Distributed modular packet switch employing recursive partitioning

ABSTRACT

Apparatus, and accompanying methods for use therein, for illustratively implementing a large (e.g. approximately 1 Terabit/second) packet switch (200) or a non-buffer based statistical multiplexor (1810), using a crossbar matrix network in which, first, the output ports of individual switching elements (e.g. 1340 1 ,1, 1340 2 ,1) are partitioned into various groups (e.g. 1110) in order to share routing paths (links) (e.g. 1115 1 , 1115 2 , . . . , 1115 K ) among the elements in any such group and, second, the outputs of each such group are themselves recursively partitioned into a succession of serially connected groups (e.g. 1140, 1160) that each provides a decreasing number of outputs until one such output is provided for each corresponding output port (278 1 , 278 2 , . . . , 278 N ) of the switch. Such a switch also utilizes channel grouping to improve overall performance and a crossbar switching fabric that internally distributes contention resolution and filtering functions among the individual switching elements themselves to reduce complexity, provide modularity, reduce growth limitations and relax synchronization requirements of the entire switch.

CROSS-REFERENCE TO RELATED APPLICATIONS

Reference is made to divisional applications, Ser. No. 637,230, filedJan. 3, 1991, now U.S. Pat. No. 5,124,978, issued Jun. 23, 1992, andSer. No. 637,137, filed Jan. 3, 1991, now abandoned in favor ofcontinuation application Ser. No. 821,264, filed Jan. 10, 1992.

BACKGROUND OF THE DISCLOSURE

1. Field of the Invention

The invention relates to apparatus, as well as to accompanying methodsfor use therein, for illustratively implementing a large (e.g.approximately 1 Terabit/second) packet switch or a non-buffer basedstatistical multiplexor, using a crossbar matrix network in which,first, the output ports of the individual switching elements arepartitioned into various groups in order to share routing paths amongthe elements in any such group and, second, the outputs of each suchgroup are themselves recursively partitioned into a succession ofserially connected groups that each provides a decreasing number ofoutputs until one such output is provided for each corresponding outputport of the switch. Such a switch also utilizes channel grouping toimprove overall performance and a crossbar, e.g., crosspoint matrix,switching fabric that internally distributes contention resolution andfiltering functions among the individual switching elements themselvesto reduce complexity, provide modularity, reduce growth limitations andrelax synchronization requirements of the entire switch.

2. Description of the Prior Art

Presently, the growing deployment of the public integrated servicesdigital network (ISDN) throughout the nationwide telephone systempermits each ISDN subscriber to gain access to a communication channelthat possesses a significantly increased bandwidth over that availablethrough a conventional telephone (i.e. POTS--plain old telephoneservice) connection. Although the bandwidth provided by basic rate ISDNservice has the potential to provide a wide variety of new communicationservices to each of its subscribers, in the coming years variouscommunication technologies that are just now emerging, such as broadbandvideo and very high speed data transmission, are expected to imposebandwidth requirements on subscriber ISDN channels that will far exceedthe bandwidth obtainable at a basic rate ISDN interface. Such aninterface consists of two 64 kbit/second "B" channels and one 16kbit/second "D" channel, where the "D" channel is a packet channel whichcarries signalling information for communication occurring over each Bchannel.

For example, broadband video service offerings might include: desktopteleconferencing having voice/video/data communication from a singleterminal located at one's desk, distribution video, video-on-demand,videotelephone, still video picture services and high definitiontelevision. In terms of bandwidth, just one high definition televisionsignal is expected to require, depending upon the manner in which it isencoded, at least 45 Mbit/second of channel bandwidth. Clearly, thebandwidth of such a signal far exceeds that furnished by a basic rateISDN channel.

In an effort to provide sufficient channel bandwidth to meet expectedsubscriber demand in a public ISDN environment, the art has turned toimplementing so-called broadband ISDN (B-ISDN). In B-ISDN, eachsubscriber channel is presently envisioned as providing an informationtransfer capacity of approximately 150 Mbit/second. This rate is chosento provide a minimally sufficient bandwidth at a subscriber interface tosimultaneously carry a broadband video service, such as high definitionvideo, and various narrowband services, such as voice transmission. Inaddition, B-ISDN is also expected to serve as a high speed datatransport facility for interconnecting separate local area networks(LANs). Presently, Ethernet based and many other types of LANs generallyoperate at a gross bit rate of approximately 10 Mbit/second. A proposedLAN, the Fiber Distributed Data Interface, is expected to operate at agross bit rate of 125 Mbit/second. With this in mind, a bandwidth of 150Mbit/second currently appears to be sufficiently fast to satisfactorilyinterconnect a wide variety of different LANs, encompassing those thatare currently in use to many of those that are presently being proposed.Furthermore, B-ISDN must also fully accommodate relatively slow ISDNtraffic, such as that which occurs at the basic rate.

ISDN involves a marriage of two different transport and switchingtechnologies: circuit switching and packet switching. Circuit switchinginherently involves continuously maintaining a real time communicationchannel at the full channel bandwidth between two points in order tocontinuously carry information therebetween throughout the duration of acall. Owing to this inherent characteristic, circuit switching can notefficiently accommodate bursty traffic and, for this reason, isgenerally viewed in the art as being ill suited for use in B-ISDN.Specifically, communication for many services that will occur atrelatively low information transfer rates in a B-ISDN environment willappear as periodic bursts when transported over a B-ISDN subscriberchannel. In addition, high speed data, such as that occurring over a LANinterconnection, will itself be bursty even apart from the channel.Bursty communications do not require full channel bandwidth at alltimes. Whenever a circuit switched connection is used to carry burstytraffic, available communication bandwidth that is dedicated to carryingdata that occurs between successive bursts, i.e. whenever there is noinformation to be transferred, is simply wasted. Inasmuch as burstycommunications, of one sort or another, are expected to constitute asignificant portion of B-ISDN traffic, the significant inefficienciesthat would otherwise result from using circuit switched connections tocarry bursty traffic through a communication channel generally dictateagainst using circuit switched connections in a B-ISDN environment.

Despite the inherent limitation on carrying bursty traffic at highefficiencies over circuit switched connections, attempts are still beingmade in the art to adapt circuit switching to a B-ISDN environment.Nevertheless, while many advances have been and are continuing to bemade in circuit switching technology, circuit switching still remainspoorly adapted to supporting communication services that occur overwidely diverse information transfer rates, such as those which areexpected to occur in B-ISDN. For example, one attempt advocatesoverlaying a number of circuit switching fabrics to form a network, witheach different fabric operating at a transfer rate of a single prominentbroad- or narrowband service. Unfortunately, if this attempt were to beimplemented, then segregated switching fabrics would likely proliferatethroughout the public telephone network which would disadvantageouslyand unnecessarily complicate the tasks of provisioning, maintaining andoperating the network. Hence, this attempt is not favored in the art.Another attempt in the art aims at providing multi-rate switching. Here,a single group of allocated channels would provide informationtransport, with each channel providing information transport at adifferent multiple of a basic transfer rate. A switch would then bedynamically reconfigured, based upon each subscriber' s needs, tosupport specific services therefor that occur at different transferrates. Unfortunately and disadvantageously, the resulting switch wouldbe considerably more complex than a single rate circuit switch.Furthermore, all channels in a group would need to be synchronized withrespect to each other and with no differential delay occurringthereamong. Owing to the need from time to time to switch calls from onephysical facility to another as required by network maintenance,maintaining the necessary intra-group synchronization is likely to bequite difficult. As such, this proposal is also not favored. In thisregard, see, H. Ahmadi et al, "A Survey of Modern High-PerformanceSwitching Techniques", IEEE Journal on Selected Areas in Communications,Vol. 7, No. 7, September 1989, pages 1091-1103 (hereinafter referred toas the Ahmadi et al publication); and J. J. Kulzer et al, "StatisticalSwitching Architectures for Future Services", International SwitchingSymposium ISS'84, Florence, Italy, May 7-11, 1984, Session 43A, paper 1,pages 1-5 (hereinafter referred to as the Kulzer et al publication).

Given the drawbacks associated with circuit switched connections, packetswitched connections, specifically using asynchronous transfer mode(ATM), presently appear to be the preferred mode of communication overB-ISDN. This mode involves asynchronous time division multiplexing andfast (high speed) packet switching. In essence, ATM relies onasynchronously transporting information in the form of specializedpackets, i.e. so-called ATM "cells". Each ATM cell includes a headerfollowed by accompanying data. The header contains a label, which isused for multiplexing and routing, that uniquely identifies the B-ISDNchannel which is to carry that cell between two network nodes. Aspecific periodic time slot is not assigned to carry a cell on anyB-ISDN channel. Rather, once an ATM cell reaches, for example, a B-ISDNswitch, fast packet switching occurs: a route is dynamically establishedthrough the switch to an output destination for that particular cellfollowed by transport of the cell over that route, and so on for eachsuccessive cell. A route is only established in response to the cellreaching an input of the switch.

Advantageously, ATM communication allows any arbitrary informationtransfer rate up to the full facility rate to be supported for a B-ISDNservice by simply transmitting cells at a corresponding frequency intothe network. With ATM, channel bandwidth is dynamically allocated to anyB-ISDN call and simply varies with the rate at which cells for that callare applied through a B-ISDN channel. No further intervention isrequired by either the subscriber or the network itself to utilizediffering amounts of available channel bandwidth as the need thereforarises. Any change in that subscriber's traffic patterns or services,even if dramatic, merely results in a changing mix of cells that arepresented to the network for these services and changes in theircorresponding rates of occurrence. As long as sufficient bandwidth isavailable on any subscriber channel to carry all the cells presentedthereto, the ATM switching fabric merely continues to route cells totheir appropriate destinations and remains essentially unaffected by anysuch change. Hence, by decoupling the information transfer rates fromthe physical characteristics of the switching fabric and providing thecapability to handle bursty traffic, ATM is particularly well suited totransporting both bursty and continuous bit rate services and istherefore preferred for B-ISDN service. In this regard, see the Kulzeret al publication.

An essential ingredient of B-ISDN is an ATM switch. In order to supportB-ISDN, that switch needs to possess the capability of routing cells atan information transfer rate of at least 150 Mbit/second betweenseparate ATM ports. Based upon current estimates, a large central officeB-ISDN switch is expected to handle approximately 80,000 subscriberlines each having a 150 Mbit/second channel. With a concentration ratioof 10 to 1, the switch needs to possess a total throughput ofapproximately 1.2 Terabit/second (1.2×10¹² bits/second).

Crossbar based switch architectures have received a great deal ofattention in the art. The reason for this is simple: crossbar switcheshave historically proven to be very reliable under actual serviceconditions and, are internally non-blocking, i.e. once appropriateconnections are established through a cross bar matrix at any given timethere will be no contention for any link residing within that matrix andthereby two cells will not collide within the matrix. See, e.g. U.S.Pat. No. 4,692,917 (issued to M. Fujoika on Sep. 8, 1987). Crossbarswitches also possess the capability of being able to dynamicallyisolate a number of separate switching elements from active servicewithout significantly affecting the throughput of the entire switch.However, crossbar switches possess several drawbacks which must beadequately addressed in any switch design. First, crossbar switchessuffer from output port contention, i.e. two or more packets attemptingto simultaneously appear at the same output port. Due to thenon-deterministic (random) nature of packet arrival times anddestinations, contention can occur in any packet switch architecture.Second and more significantly, crossbar type switches tend to contain avery substantial number of crosspoint elements and interconnects. Inparticular, since each of N inputs is connected to each of N outputs, acrossbar matrix contains N² crosspoint elements and interconnections.Inasmuch as a 1 Terabit/second switch for B-ISDN service is expected toservice approximately 6000-8000 (or more) input ports, this necessitatesthat a crossbar matrix for use in such a switch must containapproximately 36-64 Million (or more) separate crosspoints and a similarnumber of interconnections. Such a large number of crosspoints andinterconnections is not only very complex to implement but alsoinordinately costly. Furthermore, crossbar based switches frequentlyrely on using centralized circuitry to control routing and performcontention resolution. Use of such circuitry further complicates theinterconnect wiring owing to the additional wiring needed to connect thecentralized circuitry to and from each individual switching element.This added complexity may rival or even exceed that required within thecrossbar matrix itself. As such and principally because of the resultingcost and complexity, the art teaches that a single stage crosspointmatrix should be used only in those instances where the packet switch isrelatively small or where a relatively small crosspoint matrix forms abuilding block of a large multi-stage switch. In this regard, see pages1098 and 1099 of the Ahmadi et al publication as well as pages 4 and 5of the Kulzer et al publication.

Nevertheless, owing to the advantages inherent in crossbar basedswitches which are not present or readily attainable in other well-knownswitch architectures, such as Batcher-Banyan and other designs that relyon cascaded routing networks, significant work has been undertaken inthe art to modify a crossbar matrix in an effort to ameliorate thedisadvantages heretofore associated with using a crossbar matrix in alarge packet switch.

Output port contention can be remedied by incorporating a queue,specifically buffers, in one or more locations in the switch to storeone (or more) contending packets for an output port while anothercontending packet is routed through that port. For a crossbar switch, abuffer(s) can be placed at the input ports, at the output ports orwithin each crosspoint element itself. Use of such a buffer along withassociated centralized control circuitry can, depending upon thelocation of the buffer(s), significantly increase the cost andcomplexity of the switch. In this regard, buffer placement and size tendto be critical issues in switch design. Increasing the number of buffersgenerally increases the throughput of the switch, i.e. the load that canbe carried before packets are lost, but at the expense of added hardwareand associated delay in transporting packets through the switch. The artteaches that, in resolving contention, output port buffering providesthe highest switch throughput as compared to the input or crosspointbased buffering and is therefore the favored approach. In this regard,see page 1096 of the Ahmadi et al publication.

With this in mind, the art has recently proposed a crossbar basedarchitecture for a large, high speed, e.g. approximately 1Terabit/second, packet switch, such as that suited for ATM service,which incorporates output buffering. This architecture, which isreferred to as the so-called "Knockout" switch and is currentlyreceiving relatively wide attention in the art, is aimed at reducing thenumber of interconnections occurring between all the switching elementsand a centralized controller and hence some of the cost and complexityassociated with implementing a large packet switch from a large crossbarmatrix as well as providing increased delay/throughput performance. See,for example, Y. Yeh et al, "The Knockout Switch: A Simple, ModularArchitecture for High-Performance Packet Switching", IEEE Journal onSelected Areas in Communications, Vol. SAC-5, No. 8, October 1987, pages1274-1283; and H. Ahmadi et al, "A Survey of Modern High-PerformanceSwitching Techniques", IEEE Journal on Selected Areas in Communications,Vol. 7, No. 7, September 1989, pages 1091-1103. In essence, a Knockoutswitch contains a separate input line for each input; with N suchinputs, the switch contains N such lines as well as N separate routingpaths extending therefrom to each of N associated interfaces. Incomingpackets on any one input are broadcast over the corresponding input lineto all N routing paths connected to that line. Each such interfacecontains N packet filters, an N-to-L concentrator (where the value of Nis substantially greater than the value of L) and a shifter and sharedbuffer. Each packet filter is connected to a different one of the Ninput lines. The outputs of each packet filter feeds the concentratorwhich, in turn, feeds the shifter and shared buffer. Operationallyspeaking, each of the packet filters receives incoming packets from aparticular input line and examines the routing header in each of thesepackets. Within any one output port, the packet filter routes only thosepackets, which possess a routing address that matches the address forthe particular output port, onward on to an input of the concentrator.In this manner, the packet filters provide a self-routing function. Theconcentrator then selects L packets from its N incoming lines. The Lpackets are stored in their order of arrival in the shared buffer.Stored packets are then shifted out of the shared buffer in seriatim andapplied to an appropriate output interface module which, in turn,applies the packets to an output port of the switch. If more than Lpackets are simultaneously routed through the packet filters to theconcentrator, the concentrator simply drops out, i.e. knocks out, allthe excess packets therefrom. Owing to the error detection andcorrection capabilities (including packet re-transmission) inherent in apacket, particularly ATM, network, a relatively small amount of cellloss can be readily tolerated. Due to the natural randomness of thearriving cells, the art has specifically observed that if the value of Lis sufficiently large, then the probability of L simultaneouslyoccurring packets being routed to the same output port in one ATM celltime interval is very small. For example, if L is set to twelve, andassuming uncorrelated packet traffic occurs among the input ports withuniform packet distribution by the concentrator, then the probabilitythat more than 12 ATM cells will be destined to at any one output portduring a single ATM cell time interval becomes approximately 10⁻¹⁰Inasmuch as the expected cell loss of an optical fiber link andassociated circuitry is expected to be on the order of 10⁻⁹, the cellloss inherent in the knockout switch is acceptable and, for non-realtime services, can be readily compensated by appropriate re-transmissionof "knocked out" cells. Since cell knockout and concentration ofremaining cells effectively resolve contention within any one outputport, a knockout based switch does not need a centralized circuit toresolve contention. Moreover, since all the bus interfaces in such aswitch collectively implement a self-routing function, a centralizedcircuit to control routing is not needed either. While the eliminationof such a centralized control circuit significantly reduces theinterconnect wiring by eradicating the wiring heretofore required bythat circuit, a substantial number of interconnects still remains. Inthis regard, as discussed above, each interface in a knockout switch isconnected to every one of the N input lines thereby necessitating for anN line switch, N² separate interconnections. For a large switch (e.g.N=approximately 8000), a large number of interconnections is still quitecomplex and costly to implement.

Thus, a need exists in the art for a large, e.g. at least 1Terabit/second, packet switch particularly suited for use with ATMcommunication that utilizes the knockout principle but with a markedlyreduced number of interconnections within the switch fabric over thatrequired by conventional knockout switches known in the art.

SUMMARY OF THE INVENTION

My inventive large capacity packet switch substantially eliminates thedeficiencies associated with knockout type packet switches known in theart. Specifically, my inventive architecture, while based upon theknockout principle, requires substantially fewer interconnections withina crossbar matrix than heretofore required by knockout switches known inthe art.

First, in accordance with specific teachings of my invention, if eachcrosspoint switching element used within a knockout switch alsocontained a packet filtering capability, then the packet filters couldbe distributed into the switching elements themselves therebyeliminating the need to utilize N² separate packet filters andassociated interconnections. As such, only L separate lines would needto be routed to each output buffer. While this inventive arrangement,which I refer to as a "distributed knockout switch", substantiallyreduces the number of interconnects between the "N" input lines and theoutput buffers to L×N rather than N², nevertheless, it still requires arelatively large number of switching elements, i.e. L×N². In thisregard, if the value of "L" is set to twelve, then 12N² switchingelements would be required. A switching element, due to economiesachievable through circuit integration, is likely to be much lessexpensive than a wired interconnect. Moreover, due to the uniformity andregularity with which these elements are interconnected, a high level ofcircuit integration could be achieved to further reduce the cost of allthese elements. However, for a switch with large N, upwards of 6000-8000inputs such as in a 1 Terabit/second ATM switch, the number of suchswitching elements that would be required in such a switch is stillexceedingly large.

Accordingly, I have extended the teachings of my distributed knockoutswitch to result in an inventive switch architecture, hereinafterreferred to as a "recursively grouped distributed knockout switch", thatnot only substantially reduces the number of wiring interconnectsassociated within a crossbar matrix contained in a conventional knockouttype switch but also advantageously and significantly reduces the numberof individual switching elements that heretofore would be required in mydistributed knockout switch by approximately one order of magnitude.

In particular, my inventive recursively grouped distributed knockoutswitch utilizes a succession of routing stages and extends the principleof sharing, as used within the switching matrix itself in my distributedknockout switch, to encompass output sharing between successive routingstages. Instead of just providing only one output line for each group of"L" shared vertical interconnection lines (links) as occurs in mydistributed knockout switch, my recursively grouped distributed knockoutswitch also shares a group of "M" separate output lines for each routingstage among a group of shared interconnection lines and then applieslink and output sharing on a recursive basis, to implement multiplelevels of output sharing, within the crossbar matrix.

Each separate stage is implemented through a grouping network. The inputlines presented to each grouping network in a given stage consists of agroup of shared output lines provided by the immediately previous stage,or for the first stage, all the input lines applied to the distributedknockout switch. The number of shared output lines in any group is setto a number which assures that the probability of lost cells resultingfrom contention occurring among incoming cells for simultaneous routingto all these output lines is sufficiently low, e.g. 10⁻¹⁰. For example,if 256 separate shared output lines are to be provided among N inputlines, then, to provide a cell loss probability of 10⁻¹⁰, the number ofshared output lines in any one shared group can be reduced from 12N to1.25N. Hence, for 8192 input lines, each shared output group would needto provide 320 output lines (256×1.25). Each of these output groupswould then form the input lines to a next successive grouping networkwhich itself provides groups of shared output lines, and so on, all thewhile reducing the number of shared output lines produced by eachsuccessive grouping network until only one output is provided by thelast stage. This single output provided per stage would serve as anoutput port of the switch. An 8192 input ATM packet switch could beimplemented with three serially connected stages of grouping networks:the first stage providing 256 separate shared output groups of 320shared output lines each for all 8192 inputs; the second stage providing8 separate shared output groups of 64 shared output lines for eachincoming group of 320 lines from the first stage; and the third stageproviding 32 groups of 12 output lines each for each incoming group of64 lines from the second stage. To provide appropriate outputsynchronization, an output buffer statistically multiplexes the cellsappearing on each group of 12 shared output lines and stores themultiplexed cells in an internal queue. The queue is then sequentiallyread with a serial bit-stream produced thereby being applied to anassociated output port of the switch. Alternatively, each third stagegrouping network and its associated output buffers could be replacedwith an appropriate concentrator, implemented using either time or spacedivision multiplexing, to provide a group of shared output channels forcarriage over, for example, a single trunked connection.

Each grouping network is formed of multiple paralleled equal sizedmatrices of rows and columns of identical switching elements. Eachseparate matrix provides a shared output group with the number ofswitching elements in each column being equal to the number of sharedoutput lines within that group. The number of rows in each matrix equalsthe number of input lines provided to that grouping network. Theswitching elements within each such matrix are serially connected in adaisy-chained fashion both horizontally and vertically to simultaneouslydistribute cells as well as accompanying timing and clock signals fromone switching element to the next within that matrix. Each of theseswitching elements simultaneously receives incoming cells from twodirections: from the top (north) or left (west) and resolves contentionbetween these cells, both in terms of prepended cell addresses andpriority information, and routes these cells either in a crossedpattern, i.e. to the bottom (south) and right (east), respectively, orin a non-crossed pattern, i.e. to the east and south respectively, tosuccessive switching elements in the same matrix. As such, incoming ATMcells successively propagate to the right within any matrix, with highpriority cells being given priority over low priority cells for any oneshared output line in that group. If more cells are contending for agiven number of output lines, then the excess cells are merely droppedoff, i.e. "knocked out".

By distributing the contention resolution function throughout theindividual switching elements themselves, this advantageously eliminatesthe need to incorporate a centralized contention resolution device in myswitch thereby substantially simplifying the resulting interconnectwiring used within the switch fabric.

Moreover, since none of the switching elements contains a buffer, myinventive recursively grouped distributed knockout switch advantageouslypreserves the ordering of incoming cells as they transit through theswitch. Furthermore, since the interconnect wiring between adjacentswitching elements is short and regular, relatively little power isneeded to drive each of these interconnects thereby allowing relativelysmall drivers to be used in each of these elements. This, in turn,advantageously reduces the power requirements and heat dissipationassociated with each of these elements and, on an overall basis, for theentire ATM switch. In addition, since synchronization essentially needsto occur only from one switching element to the next but not on anend-to-end basis throughout the entire switch, synchronization issubstantially easier to implement in my inventive recursively groupeddistributed switch than in packet switches known in the art. Also, sinceidentical switching elements are used throughout the entire switch andthe interconnections among these elements are highly regular bothhorizontally and vertically from one such element to the next, theswitching elements can be integrated at a relatively high density on asingle integrated circuit.

Advantageously, a recursively grouped distributed packet switch ofnearly any size can be readily fabricated by appropriately scaling thesizes of the grouping networks accordingly, in terms of the number ofthe groups of shared output lines produced by each network in any onestage, the number of shared output lines in each of these groups and thenumber of successive stages that are to be used. In accordance with myteachings, the number of output lines served by all such networks wouldbe chosen to provide an acceptably low cell loss probability within eachnetwork.

In accordance with a feature of my invention, a bufferless statisticalmultiplexor can be readily fabricated through use of a grouping networkthat is sized in a manner consistent with my inventive teachings.

BRIEF DESCRIPTION OF THE DRAWINGS

The teachings of the present invention can be readily understood byconsidering the following detailed description in conjunction with theaccompanying drawings, in which:

FIG. 1 shows a typical ATM cell, and its constituent fields, astransported through my inventive packet switch;

FIG. 2 is a high level block diagram of a broadband ISDN switch;

FIG. 3A is a block diagram of a typical interface module, illustrativelymodule 210₁, shown in FIG. 2;

FIG. 3B is a block diagram of a typical header processing unit,illustratively unit 310₁, shown in FIG. 3A;

FIG. 4 is a high level flowchart of Routing Header Prepending and VCITranslation Routine 400 undertaken by processor 360 in header processingunit 310₁ shown in FIG. 3B;

FIG. 5 is a high level block diagram of a typical knockout type packetswitch known in the art that can be used in the B-ISDN switch shown inFIG. 2;

FIG. 6 is a high level block diagram of my inventive distributedknockout switch that can be used in the B-ISDN switch shown in FIG. 2;

FIG. 7 is a high level block diagram of my inventive distributedknockout switch shown in FIG. 6 but implemented with a grouping networkand routing link sharing;

FIG. 8 shows various curves that collectively depict cell lossprobability, at an offered load of 0.9, for various values of group size(M) and group expansion ratio (L);

FIG. 9 shows various curves that collectively depict cell lossprobability for an infinite number of input lines (N) and various valuesof group size (M) and group expansion ratio (L), again at an offeredload of 0.9;

FIG. 10 shows various curves that collectively depict values of groupexpansion ratio (L) and group size (M) for three different cell lossprobabilities as well as the limiting product of L and M, again at anoffered load of 0.9;

FIG. 11 is a high level block diagram of my inventive recursivelygrouped distributed knockout switch that can be used in the B-ISDNswitch shown in FIG. 2;

FIG. 12 is a block diagram of grouping network 1110 shown in FIG. 11;

FIGS 13A and 13B, when arranged as indicated by a block diagram ofillustrative contention units 1270₁,1, 1270₂,1 and 1270₃,1 and theirinterconnections shown in FIG. 12 and the manner in which illustrativeincoming ATM cells are routed through these units;

FIG. 14 diagrammatically shows the amount of skew that occurs betweenadjacent bit streams within a column of switching elements, specificallycolumn 1265₁, in grouping network 1110 shown in FIG. 12;

FIG. 15 is a circuit diagram of my inventive switching element,illustratively element 1340₁,1 shown in FIG. 13;

FIG. 16 depicts various waveforms that occur within illustrativeswitching element 1340₁,1 shown in FIG. 15;

FIG. 17A shows a block diagram of one embodiment of a L'×M' to M'concentrator for incorporating channel grouping, through space divisionmultiplexing, into my inventive recursively grouped distributed knockoutswitch shown in FIG. 11;.

FIG. 17B shows a block diagram of a second embodiment of an L'×M' to M'concentrator that can also be used to incorporate channel grouping, herethrough time division multiplexing, into my inventive recursivelygrouped distributed knockout switch shown in FIG. 11; and

FIG. 18 shows a block diagram of a second embodiment of an interfacemodule that can be utilized in B-ISDN switch 200 shown in FIG. 2 andspecifically such a module implemented using a bufferless statisticalmultiplexor implemented through a grouping network in accordance withthe teachings of my invention.

To facilitate understanding, identical reference numerals have beenused, where possible, to designate identical elements that are common tothe figures.

DETAILED DESCRIPTION

After considering the following description, those skilled in the artwill clearly realize that the teachings of my invention can be readilyutilized in implementing nearly any packet switch of essentially anysize, regardless of whether that switch is to be used for service inISDN (Integrated Service Digital Network) or not. Nevertheless, forpurposes of illustration and to simplify the ensuing description, theinvention will be specifically discussed in the context of a8192-by-8192 port packet switch particularly suited for switchingasynchronous transport mode (ATM) packets which are applied to eachinput of a broadband ISDN (B-ISDN) switch at a rate of 155.52Mbit/second (STS-3c rate).

A. Basic ATM Cell Structure

Broadband ISDN relies on transporting individual packets of digital datathrough a packet network situated between user terminals. To providedata carriage for a sufficient number of services, including a highdefinition video channel, a broadband ISDN user is to be provided withan STS-3c bit rate data channel. Such a channel has a total throughputof 155.52 Mbit/second and an effective data throughput, excludingoverhead bits, of approximately 150 Mbit/second.

Each broadband ISDN packet is commonly referred to as a "cell". FIG. 1shows a typical ATM cell, and its constituent fields, both as suppliedby a broadband ISDN terminal and subsequently transported through myinventive packet switch. As shown, incoming ATM cell 110 is typically 53octets (bytes) long. This cell contains five-octet header 115 followedby all remaining bits (48 octets). Header 115 contains virtual channelidentifier (VCI) field 116, single bit priority field 117 and a numberof remaining bytes for use with other applications. On an STS-3c line, a53 byte ATM cell is typically delivered every 2.83 μsec and, excludingthe overhead bits, provides an effective capacity of approximately 150Mbit/second.

The VCI identifies a specific virtual channel, extending between a nodewithin the B-ISDN network to the next successive such node that is totransport the cell. The specific channel and hence its corresponding VCIvaries from one node to the next as the cell is transported throughsuccessive network nodes. Priority field 117 is embedded within theheader 115. The value of the priority field is determined during callset-up negotiations and, as a result, is appropriately set by the userterminal that initially produced cell 110. This field specifies thepriority, relative to that associated with other cells, at which thecell is to be transported through the B-ISDN network.

As will be described in much detail below, my inventive switch isself-routing. This means that, prior to that cell being launched intothe network, a route for a cell does not need to be extended through thenetwork including all the switches therein. In fact, with self-routingswitches, information stored within each cell itself is used to form aroute through each switch whenever that cell reaches that switch. Inthis regard, my inventive switch, in a manner to be described below,translates the VCI of each incoming cell into a new VCI (to identify anoutput virtual channel from the switch) and prepends a three stagerouting header 120 to that cell. The routing header is strictly forinternal use in routing the entire cell through my inventive switch. Therouting header, indicated by dotted lines, is prepended to each suchcell upon entry of that cell into the inventive switch and issubsequently stripped off that cell prior to that cell being transmittedinto the output virtual channel. As shown in FIG. 1, routing header 120contains three fields: first stage routing header 127, second stagerouting header 125 and third stage routing header 123. Each routingheader is used to route the entire cell through a corresponding one ofthree separate successive routing stages, as discussed in detail below,that are used in my inventive switch. In addition, each routing headerstores a pre-defined bit sequence. This sequence, typified by thatsituated in header 123, contains a series of address bits (a₀, a₁, . . ., a_(m'-1)) followed by an activity ("busy") bit (b) which, in turn, isfollowed by two priority bits (p₀ and p₁). The value of the prioritybits are the same for all of the three routing headers and are obtainedas a result of translating VCI field 116. The activity bit merelyspecifies whether the accompanying cell is carrying valid information.Across the three routing headers k, j and m' address bits arerespectively used for routing the cell through the first, second andthird stages of the switch. Apart from over-writing the VCI field, cell110 is treated simply as information and provided with bit-serialtransport through the switch. The resulting ATM cell including theprepended three stage routing header as transported through my inventiveswitch is denoted by reference numeral 100.

B. Overall Architecture of the Inventive B-ISDN Switch

FIG. 2 is a high level block diagram of a broadband ISDN switch 200. Forpurposes of simplification, various control and clocking signals andassociated circuit blocks that would be readily apparent to thoseskilled in the art have been intentionally omitted from this and otherfigures.

As shown, switch 200 is basically formed of interface modules 210,control and service modules 295, cross-connect 220, demultiplexors 230,multiplexors 280, switch fabric 250 and switch control module 290.Interface modules 210 consisting of identical modules 210₁, 210₂, 210₃,. . . , 210_(j) interface a number of user lines 205, specificallycorresponding line groups 205₁, 205₂, 205₃, . . . , 205_(j) to switch200. User terminals (well known and not shown) are connected to the farend of each of these user lines and supply incoming ATM cells inbit-serial fashion thereto and receive outgoing ATM cells therefrom. Inessence, each of the interface modules provides a number of essentialnetwork functions: it terminates each of its associated data lines,whether emanating from a user or the network; it protects the B-ISDNnetwork both physically (electrically) and in terms of maintainingincoming data in an appropriate form suitable for carriage through thenetwork; it provides a policing function by, for example, limiting thedata rate (channel bandwidth) accorded to a user to that which the userhas specifically contracted; it concentrates and sorts incoming packets,as needed; and, as discussed in detail below, it performs cell headertranslation for each incoming ATM cell and prepends a three-stagerouting header to each such cell. Through appropriate lines within lines215, each interface module bi-directionally communicates with theremainder of switch 200 by providing incoming cells at an STS-48 rate(16 times the basic STS-3c rate or approximately 2.5 Gbit/second) andreceiving outgoing cells at the same rate. Each of the interface modulesis connected to switch control module 290 through leads 293 and isappropriately monitored and controlled thereby. Under the control ofswitch control module 290, control and service modules 295, provide,also through appropriate lines within lines 215, special purpose inputsand outputs, such as for packet test and switch operations andmaintenance connections, into switch 200.

Generally speaking, switch control module 290 performs a number ofessential control, test and administration functions for switch 200. Toeffectively perform these functions, switch control module 290, overleads 293, bi-directionally communicates with and controls each of theblocks that constitutes switch 200 including interface modules 210,cross-connect 220 and switch fabric 250. For example, switch controlmodule 290 processes incoming calls by establishing and tearing downappropriate virtual connections through switch 200 for each such call,selecting routes through cross-connect 220 for incoming and outgoing ATMcells that constitute each call handled by switch 200, determining thespecific header translation that is to occur within each interfacemodule and causing each such translation to occur. In addition, theswitch control module also performs network maintenance andadministrative functions by respectively attempting to locate and repairproblems within the network itself and maintaining data on theperformance and status of switch 200 and its interactions with thenetwork. Switch control module 290 also distributes traffic betweenswitch 200 and the remainder of the network in order to efficiently useexisting network resources. In addition, module 290 also responds tovarious user inquiries as well as user requests to change service.

Switch control module 290 also performs periodic routine diagnostictests of the entire switch. In particular, switch control module 290periodically executes a sequence of diagnostic operations to applypre-defined ATM test cells to and test the resulting operation, on anend-to-end basis, of the entire switch as well as to test the operationof each of the blocks, as set forth above, within both the switch andthe switch fabric. Through these diagnostics, switch control module 290is able to detect failure conditions and, in the event of such afailure, invoke appropriate corrective action to counteract the failure.Switch control module 290 is formed of any one of many well-knownrelatively large stored programmed computers and associated peripheraland memory circuits.

Cross-connect 220 is a computer controlled switching matrix thatprovides circuit switched connected between lines 215, which areconnected to interface modules 210 and control and service modules 290,and lines 225. The connections through the cross-connect are establishedby switch control module 290 and are dynamically changed, as needed, inthe event of a failure within switch fabric 250 (such as an input oroutput module or shared line group) to provide fault tolerant B-ISDNswitching operation. High speed trunks, connected through appropriatespecialized interface modules would link switch 200 to other switchingnodes situated within a B-ISDN network. Since these trunks areirrelevant to the present invention, they have been omitted from thedrawing.

Lines 225 apply incoming cells at the STS-48 rate to demultiplexors 230and accept outgoing cells also at the STS-48 rate from multiplexors 280.Demultiplexors 230, which are formed of identical individualdemultiplexors 230₁, 230₂, 230₁₋₁, . . . , 230₁, demultiplex the cells,on a time division basis, occurring at the STS-48 rate and appearing onsingle incoming lines within lines 225, on a 1-to-16 basis, intoseparate bit-serial lines 235 at the STS-3c rate. Similarly, outgoingcells provided by switch fabric 250 over leads 272 at an STS-3c rate aremultiplexed, on a 16-to-1 time division basis, into single STS-48outgoing trunks situated within lines 225 by multiplexors 280 formed byidentical individual multiplexors 280₁, 280₂, 280₁₋₁ and 280₁. Each ofthe demultiplexors 230 and multiplexors 280 is connected to switchcontrol module 290 through leads 293 and is appropriately monitored andcontrolled thereby.

Incoming STS-3c lines 235 are connected to identical input modules 260located within the switch fabric and specifically to corresponding inputmodules 260₁, . . . , 260_(k). Switch fabric 250 also contains outputmodules 270 and knockout switching circuit 275, as discussed in detailbelow. The input modules provide groups of simultaneously occurringincoming cells, over "N" input lines 273, to self-routing knockoutcircuit 275 for simultaneous routing therethrough.

Outgoing cells conducted through switching circuit 275, via "N" outputlines 278, are directed to output modules 270 which are themselvesformed of identical individual output modules 270₁, 270₂, . . . ,270_(k). Each of output modules directs each of the outgoing cellsreceived by that module, but without the accompanying three stagerouting header, to one of 32 appropriate output ports on that module.Each of these ports is connected via outgoing STS-3c trunks within lines272 to multiplexors 280 and therethrough to cross-connect 220 back toeither a user line or a high speed link to another network switch. Sincethe circuitry used in either the input and output modules is readilyapparent to those skilled in the art and is not relevant to the presentinvention, these modules will not be discussed in any further detail.

C. Interface Module and Header Processing Unit

As noted above, each interface module performs several essentialfunctions. As it relates to the present invention, each interface moduleconcentrates incoming ATM cells, as needed, and for each such cellperforms cell header translation and prepends a three stage routingheader thereto.

FIG. 3A is a block diagram of a typical interface module, illustrativelymodule 210₁, shown in FIG. 2. This module contains header processingunits 310, multiplexor 320 and demultiplexor 330. As noted above, eachinterface module concentrates incoming ATM cells on a 16-to-1 ratio,thereby providing one multiplexed STS-48 line to cross-connect 220 for agroup of sixteen successive incoming STS-3c user lines. Similarly,through the demultiplexor, each interface module also demultiplexes oneoutgoing STS-48 line emanating from cross-connect 220 into sixteensuccessive outgoing STS-3c user lines. Accordingly, interface module310₁ serves incoming user lines 3051, . . . , 305₁₆ and outgoing userlines 335₁, . . . , 335₁₆ which collectively form user lines 205₁. Eachincoming user line is connected to a corresponding header processing(HP) unit located within units 310, specifically formed of headerprocessing units 310₁, . . . , 310₁₆ respectively associated with lines305₁, . . . , 305₁₆. All of the header processing units are identical.As discussed in detail below in connection with FIG. 3B, each headerprocessing unit translates the current VCI of an incoming ATM cell intoa new VCI value for transport to the next successive node in thenetwork, overwrites the current VCI field with the new VCI field and, inconjunction with the value of priority field of the incoming cell,prepends an appropriate three stage routing header to that cell forinternal use by switch fabric 250 in routing the cell therethrough. Theoutput provided by header processing units 310 are routed over seriallines 315 formed of individual lines 315₁, . . . , 315₁₆ for units 310₁,. . . , 310₁₆, to multiplexor 320. This multiplexor concentrates celltraffic across these sixteen lines, on a time division basis, onto oneSTS-48 line that feeds cross-connect 220. Leads 345 (which form aportion of leads 293 shown in FIG. 2) connect each of the headerprocessing units to switch control module 290 for use in transferringdata to the switch control module and receiving control instructions andaccompanying data from the control module. The incoming and outgoingSTS-48 trunks served by module 210₁ form trunks 215₁.

FIG. 3B is a block diagram of a typical header processing unit,illustratively unit 310₁, shown in FIG. 3A. As discussed above, for eachincoming ATM cell, this unit translates the current VCI field for thatcell into a new VCI, over-writes the current VCI with the new VCI and,in conjunction with the value of the priority field of the incomingcell, prepends an appropriate routing header onto that cell.

As shown, header processing unit 310₁ is formed of serially connectedcell buffers 340 and 350, processor 360 and memory 370. The cell buffersare connected through respective leads 363 and 355 to processor 360which itself is connected through leads 365 to memory 370. Each of thesecell buffers provides a one cell delay. The incoming one cell delaythrough cell buffer 340 provides processor 360 with sufficient time toperform table look-up operations (as described in detail below inconjunction with FIG. 4) into memory 370, as shown in FIG. 3, totranslate the current VCI for an incoming cell and formulate anappropriate three stage routing header for that cell. The bits shiftedout of cell buffer 340 are shifted into cell buffer 350 and therethroughonto lead 315₁. However, immediately prior to the occurrence of any bitsbeing shifted into buffer 350 from buffer 340 for an incoming ATM cell,processor 360 serially applies at the proper bit intervals appropriatelyvalued bits over leads 355 into cell buffer 350 in order to first appendthe three stage routing header to this cell. Thereafter, as bits forthis cell are then shifted into buffer 350, the processor seriallyapplies appropriately valued bits, also via leads 355, to an input ofbuffer 350 to over-write the VCI field for this cell with a new value.Then, to complete each such cell, all the remaining bits, specificallydata bits 113 (see FIG. 1) that form that cell are merely shifted intocell buffer 350, as shown in FIG. 3, in bit-serial fashion over lead 347from cell buffer 340. The bits shifted out of buffer 350 are applied inbit-serial fashion over lead 315₁ to an input of multiplexor 320. Assuch, each header processing unit imparts a two cell delay to eachincoming ATM cell. Inasmuch as an STS-3c cell cycle time isapproximately 2.83 μsec, this delay amounts to approximately 5.66 μsec,which is negligible compared with end-to-end delay.

FIG. 4 is a high level flowchart of Routing Header Prepending and VCITranslation Routine 400 undertaken by processor 360 in header processingunit 310₁ shown in FIG. 3B. As one can readily appreciate, thisprocessor also executes a number of other routines related to otherfunctions that are performed by the header processing unit. Inasmuch asthese functions are essentially irrelevant to the present invention andwould all be readily apparent to those skilled in the art, then, forpurposes of brevity, they have all been omitted from the followingdiscussion.

Now, specifically with respect to routine 400, execution proceeds toblock 410 upon entry into the routine. This block, when executed, readsthe value of the current VCI for the incoming ATM cell as that cell isbeing shifted into cell buffer 340. Once the current VCI field has beencompletely read, execution proceeds to block 420. This block, whenexecuted, performs a look-up operation into a table stored within memory370. For each incoming VCI value, this table stores a new VCI value,based upon the interconnection topology of the entire B-ISDN network,and an accompanying routing header. As such, the table look-up operationresults in accessing a new VCI value and an accompanying three stagerouting header. Should the network interconnection topology change,header processing unit 310₁ can load appropriate VCI values reflectingthe changed topology into the table in response to appropriateinstructions and data received over leads 293 (see FIG. 2 andspecifically over leads 345 shown in FIG. 3B) from switch control module290. To provide fault tolerance, a logical three stage routing headercan be accessed first, followed by separate logical-to-physicaltranslations (not shown) of each separate routing header throughappropriate tables in order to determine a corresponding physicalrouting address for a corresponding stage of the complete routingheader. In the event of a failure condition within switch fabric 250(see FIG. 2), appropriate changes would then be made in the separatelogical-to-physical translation tables to re-route cells throughknockout switching circuit 275 in order to bypass failed portion(s) ofthe fabric, such as in a routing stage, used in my inventive switch.This has the subsequent effect of appropriately changing thecorresponding prepended routing header. To assure that no subsequent ATMcells are directed to the failed portion(s), the tables in all theheader processing units would be simultaneously changed, typically inresponse to an instruction broadcast over leads 293 by switch controlmodule 290 to all these modules, in the event of such a failure. Byseparating the VCI and physical-to-logical translation tables, thisadvantageously helps to prevent the network data and overall networkoperation from being inadvertently corrupted in the event of amalfunction occurring in responding to a local failure within the switchfabric as well as to simplify the manner through which that failurecondition is handled. To simplify the discussion, I will assume thatblock 420, as shown in FIG. 4, only produces a physical three stagerouting header and that logical routing headers are not used.

After block 420 has been executed to access a three stage routingheader, execution proceeds to block 430. This latter block seriallyapplies the three stage routing header into cell buffer 350 at theproper bit times to prepend that routing header onto the head of theincoming ATM cell which is being shifted therein. Thereafter, executionpasses to block 440. This block, when executed, shifts the remainder ofthe incoming ATM cell, in bit-serial form, from cell buffer 340 intocell buffer 350 and therethrough onto lead 315₁ but, in the process ofdoing so, over-writes the VCI field with the newly accessed valuethereof. The value of the priority field in the prepended three stagerouting header is obtained through translation of the VCI field inconjunction with the value of the incoming ATM cell priority field. Onceblock 440 has fully executed, then execution loops back, via path 450,to block 410 to process the next incoming ATM cell that is beingserially applied to header processing unit 310₁ and so on for subsequentsuch cells.

D. Knockout Switching Circuit 275

For various reasons, the art appears to favor crossbar switcharchitectures for use in implementing N-by-N packet switching circuits,such as switching circuit 275. Crossbar switches, as do other types ofpacket switches, suffer from output contention, i.e. two or more packetsattempting to simultaneously appear at the same output port. In aneffort to resolve this contention, the art teaches that buffers,specifically queues, can be incorporated in one or more locations in theswitch to store one (or more) contending packets for an output portwhile another contending packet is routed through that port. For acrossbar switch, a buffer(s) can be placed at the input ports, at theoutput ports or within each crosspoint element itself. Use of such abuffer along with associated centralized control circuitry can,depending upon the location of the buffer(s), significantly increase thecost and complexity of the switch. In this regard, buffer placement andsize tend to be critical issues in switch design. Increasing the numberof buffers generally increases the throughput of the switch, i.e. theload that can be carried before packets are lost, but at the expense ofadded hardware and associated delay in transporting packets through theswitch. The art teaches that, in resolving contention, output portbuffering provides the highest switch throughput, assuming uncorrelatedpacket traffic incoming among the input ports, as compared to the inputor crosspoint based buffering and is therefore the favored approach

Unfortunately, crossbar type switches tend to contain a very substantialnumber of crosspoint elements and interconnects which, in turn, highlycomplicates and adds substantial expense to the task of implementing alarge scale packet switch from a single crossbar network. Moreover,crossbar switch architectures known in the art frequently rely on usingcentralized circuitry to control routing and perform contentionresolution which disadvantageously add further cost and complexity tosuch a switch. In this regard, the added complexity of the interconnectwiring between the centralized contention resolution circuit and eachindividual switching element may rival or even exceed that requiredwithin the crossbar matrix itself. As such and principally because ofthe resulting cost and complexity, the art teaches that a single stagecrosspoint matrix should be used only in those instances where thepacket switch is relatively small or where a relatively small crosspointmatrix forms a building block of a large multi-stage switch.

1. Conventional knockout packet switch

In an effort to provide a crossbar based architecture that utilizesoutput buffering, the art has recently proposed the so-called "Knockout"switch. This switch is aimed at reducing the number of interconnectionsbetween all the switching elements and a centralized controller andhence some of the cost and complexity associated with implementing alarge packet switch from a large crossbar matrix as well as providingincreased delay/throughput performance. See, for example, Y. Yeh et al,"The Knockout Switch: A Simple, Modular Architecture forHigh-Performance Packet Switching", IEEE Journal on Selected Areas inCommunications, Vol. SAC-5, No. 8, Oct. 1987, pages 1274-1283; and H.Ahmadi et al, "A Survey of Modern High-Performance SwitchingTechniques", IEEE Journal on Selected Areas in Communications, Vol. 7,No. 7, September 1989, pages 1091-1103.

FIG. 5 is a high level block diagram of conventional knockout typepacket switch 500 known in the art that can be used in the B-ISDN switchshown in FIG. 2. Here, all N input lines 273, collectively formed oflines 273₁, . . . , 273_(N), are routed, via leads 510, to each cellfilter and concentrator 530₁, . . . , 530_(N) which collectively formcell filters and concentrators 530. Leads 510 contain "N" groups of "N"leads each. Within leads 510, illustrative groups 513 and 517respectively route all the incoming cells on input lines 273 to cellfilter and concentrators 530₁ and 530_(N). Each cell filter examines theprepended routing header associated with each cell appearing on all "N"leads in its associated group and only permits those cells that have anaddress that matches the address of an associated output port, e.g.output port 278₁ for lead group 513, to pass therethrough to theconcentrator. In this manner, the cell filters provide a self-routingfunction. Each concentrator then selects L packets from its N incominglines and applies the resulting cells to a group of L leads within leads540. Specifically, "L" lead groups 540₁, . . . , 540_(N), arerespectively supplied with cells produced by cell filters andconcentrators 530₁, . . . , 530_(N). The cells appearing at the outputof each of the "N" cell filter and concentrators 530₁, . . . , 530_(N),are respectively applied to the inputs of shared output buffers 550₁, .. . , 550_(N) which collectively form shared output buffers 550 The "L"cells are stored in their order of arrival in each shared output bufferEach shared output buffer contains a single queue (not specificallyshown) Stored cells are then shifted out of each shared output buffer inseriatim and applied to an output port of the switch. If more than "L"cells are simultaneously routed to the cell filters, the concentratorsimply drops out, i.e. knocks out, all the excess cells therefrom. Inthis regard, shared output buffers 550₁, . . . , 550_(N) apply cells tooutputs 278₁, . . . , 278_(N) which collectively form output lines 278.

Owing to the error detection and correction capabilities (includingpacket re-transmission) inherent in a packet, particularly ATM, network,a relatively small amount of packet loss can be readily tolerated.Because of the natural randomness of arriving cells, the art hasspecifically observed that the probability that more than "L" cells willsimultaneously occur (and hence that cells will be dropped) at anyoutput port in one ATM cell time interval is given by equation (1)below: ##EQU1## Now, if the value of "L" is sufficiently high, the cellloss probability is very low. For example, if the value of "L" is set totwelve with an offered load at each input port of 0.9, and assuminguncorrelated packet traffic occurs among the input ports with uniformpacket distribution by the concentrator as is implicit in equation (1),then the probability that more than 12 ATM cells will be destined to atany one output port, such as output port 278₁, during a single ATM celltime interval becomes, as given by equation (1), approximately 10⁻¹⁰.Inasmuch as the expected cell loss of an optical fiber link andassociated opto-electronic interface circuitry is expected to be on theorder of 10⁻⁹, the cell loss inherent in the knockout switch isacceptable and can be readily compensated by appropriate re-transmissionof "knocked out" cells for non-real time services. Since cell knockoutand concentration of remaining cells effectively resolve contentionwithin any one output port, a knockout based switch does not need acentralized circuit to resolve contention. Moreover, since all the businterfaces in such a switch collectively implement a self-routingfunction, a centralized circuit to control routing is not needed eitherWhile the elimination of these centralized control circuitssignificantly reduces the interconnect wiring by eradicating the wiringheretofore required by these circuits, a substantial number ofinterconnects still remains. In this regard, as discussed above, each ofthe cell filter and concentrators 530 is connected to each of the inputlines. Hence, for an "N" line switch, N² separate interconnections arerequired. For a large switch, such as one having upwards of 8000 inputs,as in a typical 1 Terabit/second ATM switch, such a substantial numberof interconnections is disadvantageously quite complex and costly toimplement.

2. Distributed Knockout Switch

Hence, in accordance with the teachings of my present invention, I havemodified the prior art architecture shown in FIG. 5 in order to reducethe number of required interconnections. In essence, my modificationentails inserting crosspoint switching elements into the architecture ofFIG. 5 and incorporating a cell filtering function into each of theseelements. Doing so advantageously eliminates the need to utilize "N"separate cell filters and associated interconnection wiring. Inaddition, in view of the cell loss probability, the required number ofinterconnections from the input lines to each output buffer can beadvantageously reduced from "N" lines to only "L" lines, where L<<N. Toattain a cell loss probability on the order of 10⁻¹⁰, the value of "L"can be approximately two to three orders of magnitude less than thevalue of "N". Consequently, this provides a substantial reduction in thenumber of interconnections within the crossbar switching matrix Todistinguish my inventive switch architecture from the prior art whichutilizes centralized cell filtering, I shall hereinafter refer to myinventive architecture as the "distributed knockout switch".

FIG. 6 is a high level block diagram of my inventive distributedknockout switch 600 that can be used in the B-ISDN switch shown in FIG.2. As shown, switch 600 contains a crossbar matrix 610 formed ofidentical individual switching elements (SWEs). Each of the "N" inputlines 273 is connected to "L" switching elements which, in turn, isconnected in parallel to "L" inputs of each shared output buffer. Eachsuch buffer provides a corresponding one of the "N" switch outputs.Specifically, input lines 273₁ and 273_(N) are respectively connected toswitching elements 620 containing elements 620₁, . . . , 620_(L) andelements 630 containing elements 630₁, . . . , 630_(L). Within elements620 and 630, each column of "N" vertically aligned switching elements isconnected, via a respective lead within leads 640₁, to one of the "L"inputs of shared output buffer 650₁. Similarly, input lines 273₁ and273_(N) are also connected to switching elements 625 containing elements625₁, . . . , 625_(L) and elements 635 containing elements 635₁, . . . ,635_(L). Within elements 625 and 635, each column of "N" verticallyaligned switching elements is connected, via a respective lead withinleads 640_(L), to one of the "L" inputs of shared output buffer 650_(N).Thus, my inventive architecture shares "L" routing links among any oneoutput buffer. Shared output buffers 650 which are collectively formedof output buffers 650₁, . . . , 650_(N) provide respective output lines278 formed of lines 278₁, . . . , 278_(N).

While my inventive distributed knockout switch substantially reduces thenumber of interconnects between the N input lines and the output buffersto L×N rather than N², it nevertheless still requires a substantialnumber of switching elements, i.e. L×N². In this regard, if L is set tothe value 12, to provide an acceptably low cell loss probability on theorder of 10⁻¹⁰, then my inventive switch would require 12N² switchingelements A switching element, due to economies achievable throughcircuit integration, is likely to be much less expensive than an wiredinterconnect. Moreover, due to the uniformity and regularity with whichthese elements are interconnected, a high level of circuit integrationcan be achieved to further reduce the cost of all these elements.Nevertheless, for a switch with large N, such as upwards of 6000-8000inputs for a 1 Terabit/second ATM switch, the number of such switchingelements that would be required in such a switch is still exceedinglylarge.

3. Recursively Grouped Distributed Knockout Switch

Accordingly, I have extended the teachings of my distributed knockoutswitch to result in an inventive switch architecture, hereinafterreferred to as a "recursively grouped distributed knockout switch", thatnot only substantially reduces the number of wiring interconnectsassociated within a crossbar matrix contained in a knockout type switchby two to three orders of magnitude but also advantageously andsignificantly reduces the number of individual switching elements thatheretofore would be required in my distributed knockout switch byapproximately one order of magnitude.

My recursively grouped distributed knockout switch utilizes a successionof routing stages and extends the principle of sharing, as used withinthe switching matrix itself in my distributed knockout switch, toencompass output sharing between successive routing stages. Instead ofjust providing only one output line for each group of "L" sharedvertical interconnection lines (links) as occurs in my distributedknockout switch shown in FIG. 6, my recursively grouped distributedknockout switch also shares a group of "M" separate output lines among agroup of shared interconnection lines from each routing stage and thenapplies routing link and output sharing on a recursive basis within thecrossbar matrix.

To fully understand my inventive recursive shared packet switcharchitecture, first consider the switch architecture shown in FIG. 7.Here, as a first step, sharing has been extended to encompass therouting links.

Specifically, FIG. 7 shows a high level block diagram of my inventivedistributed knockout switch shown in FIG. 6 but implemented withgrouping network 710 and routing link sharing. As shown, all "N" inputsare connected through a group of L×M links to a group of "M" separateoutput lines. Specifically, all N input lines 273, formed of input lines273₁, . . . , 273_(N), are connected through switching elements andshared group of links, L×M in number, illustratively shared links 713connecting switching elements 620₁, . . . , 620_(L)×M and 630₁, . . . ,630_(L)×M and shared links 727 connecting switching elements 625₁, . . ., 625_(L)×M and 635₁, . . . , 635_(L)×M, to a corresponding L×M to Mdistribution network, illustratively networks 720₁ and 720_(K) situatedwithin networks 720. Each group of output lines provided by eachdistribution network is treated as having a common destination addressby the switching elements Cells which have such an address in theirprepended routing header that matches the address of the output linesare merely routed to one of the L×M shared links associated therewithEach L×M to M distribution network merely distributes the incoming cellsappearing on a corresponding group of shared routing links to "M"separate output lines (ports). "K" (where K=N/M) separate groups of L×Mshared links and associated distribution networks exist in switch 700.All switching elements 610 and the interconnecting routing linksimplement a grouping network which groups the N input lines into Kseparate groups of L×M lines. As will soon become readily apparent, byappropriately increasing the number of shared output lines that areshared within any group, i.e. the value of M (group size), the number ofshared links (L) associated therewith can be substantially reduced whilestill achieving an acceptable cell loss probability.

Now, if the ATM packet switch were to be implemented with only one levelof routing link sharing as is depicted in FIG. 7, then the number ofseparate switching elements would still be quite large, specificallyL×N². As will shortly be seen, this number can be reduced considerably,by implementing grouping network 710 from a succession of seriallyconnected routing stages that uses routing link sharing and outputsharing between successive stages on a recursive basis and throughappropriate selection of the "L" and "M" values for each such stage. Ofcourse, the last routing stage in my inventive switch does not use linksharing but rather has only one uniquely addressed output line therefromto form a corresponding switch output port. Advantageously, if thevalues of "L" and "M" are appropriately selected for each stage, thenthe number of switching elements used in my inventive ATM packet switch,as discussed in detail below, can be substantially reduced from 12N², aswould be required in my distributed knockout switch, to approximately1.42N² as would be required in my recursively grouped distributedknockout switch.

With this discussion in mind, equation (1) can be readily modified, toyield equation (2) below, to specify the cell loss probability for agroup of L×M cells that would occur during a single ATM cell timeinterval, i.e. the probability that more than L×M cells will be droppedduring any such interval. ##EQU2## where: ρ is the offered input loadfactor.

The results of this equation for an offered input load factor of 0.9(where the maximum offered input load is taken as the value 1) arecollectively shown in graphical form in FIGS. 8-10. For purposes ofthese figures and the rest of the description, the value "L" will be thegroup expansion ratio which is defined as the ratio of the number ofrequired vertical interconnection lines (shared links) to the number ofoutput lines in each group. In particular, FIG. 8 depicts through curves800 cell loss probability for various values of group size (M) and groupexpansion ratio (L). As shown, as the number of input lines in eachgroup exceeds the value 64, the cell loss probability reaches anasymptotic value of 10⁻¹². Furthermore, for a given cell lossprobability, such as illustratively 10⁻¹⁰, the required "L" valuedecreases as the group size (M) increases from illustratively one totwo. With this in mind, FIG. 9 depicts through curves 900 cell lossprobability for an infinite number of input lines (N) and various valuesof group size (M) and group expansion ratio (L). It is clearly evidentfrom FIG. 9 that, for a given cell loss probability, the value of "L"decreases as an increasing number of output lines are grouped. Forexample, given a cell loss probability of 10⁻¹⁰, the value of "L"decreases to approximately 1.25 if a group size of 256 is used, i.e. ifthe number of grouped output lines in each group equals 256. Thus, as isnow plainly evident, output line grouping allows the number of sharedrouting links to be reduced considerably. FIG. 10 depicts, throughcurves 1000, values of the group expansion ratio (L) and group size (M)for three different cell loss probabilities as well as the limitingproduct of "L" and "M". Interestingly, as the value of "L" increasesfrom 1 to 1.1 for a cell loss probability of 10⁻¹⁰, then, as shown inFIG. 10, the value of the group size decreases considerably from thevalue 2750 (not specifically shown) to the value 750.

Since my self-routing switch routes ATM cells to different groups ofshared links based on binary address bits prepended to each cell (seeFIG. 1 as discussed in detail above), the group size should bepreferably be chosen as equalling a power of two, i.e. 2^(i) with iequalling 0, 1, 2, . . . Moreover, to reduce implementation complexityand cost by reducing the number of separate switching elements, it ispreferable to choose a smaller value for L for a larger group size M.However, every group size is limited to a reasonable size in order toavoid implementational difficulties that might otherwise arise inpreserving correct cell sequencing through that group. Furthermore, tomaintain correct cell sequencing through each stage of my switch in viewof the timing differences--as discussed below--that occur betweenincoming cells applied to different inputs of that stage, the number ofshared links in any group should be less than the number of individualbits in any cell. Inasmuch as the size of an ATM cell is currentlyproposed in the art to be 53 bytes (including a five octet cell headerand a 48 octet field for ensuing data), this results in a bit count of53 times 8 or 424 bits for each ATM cell. Thus, the values of "L" and"M" should be set for each separate routing stage such that the productof these values does not exceed the value 424. As indicated, in FIG. 10,no difficulties should be presented in doing so as long as the groupsize in kept within reason. Table 1 below provides a listing ofpractical values for "L" and "M" for three different cell lossprobabilities.

                  TABLE 1                                                         ______________________________________                                        Values of "L" for different cell loss probabilities                           and group sizes (M)                                                           cell loss                                                                     prob-  Group Size (M)                                                         ability                                                                              1     2      4    8    16   32   64   128  256                         ______________________________________                                        10.sup.-6                                                                             8    5.30   3.70 2.70 2.10 1.70 1.45 1.25 1.15                        10.sup.-8                                                                            10    6.45   4.40 3.15 2.40 1.90 1.55 1.35 1.20                        10.sup.-10                                                                           12    7.50   5.05 3.60 2.65 2.00 1.70 1.45 1.25                        ______________________________________                                    

To achieve a cell loss probability of 10⁻¹⁰ within a routing network,the fewest switching elements would be required if that network isconfigured with "L" and "M" respectively set equal to the values 1.25and 256. These values meet the limit set forth above.

With all the principles set forth above in mind, once all "N" outputlines have been partitioned into a requisite number of groups, eachhaving L×M separate output lines, each such group can itself bepartitioned into smaller groups in order to further reduce the number ofoutput lines associated therewith by increasing its "L" value. Forexample, as indicated in Table 1, as the value of "L" increases from1.25 to 2, the group size decreases from 256 to 32. Accordingly, eachsuch group can itself be recursively partitioned in smaller groups withthe group size decreasing at each stage until the group size reachesone. When the group size reaches one, then all the cells are beingrouted to their proper output ports.

Hence, an ATM packet switch constructed in accordance with my inventiveteachings, can contain many stages of serially connected recursivelyconstructed grouping networks, with each grouping network providing therequisite number of output line groups and output lines in each group.For purposes of illustration, FIG. 11 shows a high level block diagramof recursively grouped distributed knockout switch that can be used inthe B-ISDN switch shown in FIG. 2. This switch has been constructed withonly three separate stages of recursive grouping networks. Only threestages are used in order to reduce hardware complexity of the switch aswell as to reduce end-to-end cell delay through the entire switch.

As shown, the switch contains three serially connected routing networkstages: Stage 1, Stage 2 and Stage 3. Stage 1 contains grouping network(GN) 1100 which receives all "N" input lines 273, specificallycontaining input lines 273₁, . . . , 273_(N), and groups these linesinto "K" (where K=N/M) separate groups 1115 of L×M shared output lines.Groups 1115 contain individual groups 1115₁, . . . , 1115_(K) of outputlines. Each of these groups is fed into a corresponding grouping networkin the second stage. In this regard, illustrative group 1115₁ feedssecond stage grouping network 1140. Grouping network 1140 groups theincoming lines in group 11151 into "J" separate groups 1145 of L'×M'shared output lines, specifically groups 1145₁, . . . , 1145_(J), whereJ=M/M'. Each of groups 1145 is, in turn, routed to a separate thirdstage grouping network 1160 which, in turn, groups the lines in each ofthe groups 1145 into "M'" separate groups 1165 of L" shared output lineseach. Groups 1165 are formed of individual L" groups 1165₁, . . . ,1165_(M) '. Each group 1165 of L" output lines is then applied to acorresponding output buffer within buffers 1170. Each output bufferstatistically multiplexes the cells appearing on its associated groupand stores the multiplexed cells in appropriate internal buffer(s). Thebuffer(s) is then sequentially read with a serial bit-stream producedthereby being applied to an associated output line of the switch.Specifically, groups 165₁, . . . , 1165_(M), are applied to outputbuffers 1170₁, . . . , 1170_(M), which, in turn, supply ATM cells inbit-serial fashion on switch output lines 278₁, . . . , 278_(M'). Theoutputs provided by all the output buffers in the switch drive outputlines 278, which contain lines 278.sub. 1, . . . , 278_(M'), . . . ,278_(N) ' of switch 1100. The statistical multiplexing function can beimplemented in one of two illustrative ways. One, the incoming cells oneach group of L" lines can be written into L" first-in first-out (FIFO)buffers and thereafter read out in round-robin fashion. A barrel shifterneeds to be situated in front of these FIFOs in order to evenly sharethe FIFOs among the incoming cells to that buffer and also to preservethe ordering of these cells. Alternatively, the statistical multiplexingfunction can be provided by multiplexing the incoming cells on atime-division basis and storing the resulting multiplexed stream in asingle FIFO. This single FIFO would then be read out in a sequentialfashion. Unfortunately, the speed of the FIFO in this implementationwould of necessity need to be L" times faster than that of eachindividual FIFO in the first implementation, though the speedrequirement could be relaxed somewhat by increasing the word length ofthe FIFO.

In any event, each third stage grouping network 1160 could be combinedwith M' output buffers 1170 to form module 1150. This module would beidentically replicated "J" times and integrated with second stagegrouping network 1140 to form module 1130. Module 1130 would itself bereplicated K times, with each such module being connected to a group ofoutput lines from first stage grouping network 1110. Modules 1130 wouldbe replicated as many times as needed given the number of input linegroups. This recursive construction advantageously is both a flexibleand highly efficient manner to grow the capacity of the entire switch1100. In addition, modules 1150 could each be replaced with asmall-scale packet switch in order to reduce the number of switchingelements and interconnection elements that would otherwise be usedtherein.

The number of switching elements in any such grouping network is equalto the product of its input and output line counts. Table 2 belowspecifies the total number of switching elements for three stage switch1100 shown in FIG. 11. Here, the value "K" equals N/M and the value "J"equals M/M'.

                                      TABLE 2                                     __________________________________________________________________________    Complexity of the grouping networks                                           for the different routing stages in switch 1100                                            Stage 1                                                                              Stage 2    Stage 3                                        __________________________________________________________________________    No. of GNs   1      K          K×J                                      No. of inputs at each GN                                                                   N      L×M  L'×M'                                    No. of outputs at each GN                                                                  L×M×K                                                                    L'×M'×J                                                                      L"×M'                                    No. of SWEs in each GN                                                                     N×L×M×K                                                            L×M×L'×M'×J                                                      L'×M'×L"×M'                  No. of SWEs at each stage                                                                  N×L×M×K                                                            K×L×M×L'×M'×J                                              K×J×L'×M'×L"×                                   M'                                             __________________________________________________________________________

The total number of switching elements in switch 1100 is given by thesum of the three terms in the last row in Table 2, or L×N²+N×L×L'×M+N×L'×L"×M'. Now, if the following values are set: M=256,L=1.25, M'=32, L'=2, and L"=12, then, for a cell loss probability of10⁻¹⁰, the total number of switching elements within switch 1100approximately equals 1.25N² +1408N. For a switch with 8192 inputs, aswould occur in a 1 Terabit/second ATM cell switch with each input lineproviding a bandwidth of approximately 150 Mbit/second, then the numberof switching elements required in my recursively grouped distributedknockout switch can be normalized to approximately 1.42N² --whichadvantageously is on the order of approximately one order of magnitudeless than the 12N² switching elements that would be required in mydistributed knockout switch.

This discussion will now proceed to describe how a grouping network isimplemented and will then describe a preferred embodiment of thecircuitry of the switching element used in any such network.

FIG. 12 is a block diagram of illustrative grouping network 1110 shownin FIG. 11. As discussed above, this network groups all "N" input linesto the switch into "K" groups, each having L×M outputs. With N, M and Lset equal to the values 8192, 256 and 1.25, respectively, each groupcontains 320 separate shared outputs. Given these values, network 1110produces 32 such groups.

As shown, network 1110 is formed of an N by K matrix of identicalcontention units, specifically units 1270₁,1, 1270₁,2,. . . , 1270₁,K,1270₂,1, 1270₂,2, . . . , 1270₂,K, 1270₃,1, 1270₃,2, 1270₃,3, . . . ,1270₃,K, . . . , 1270_(N),1, 1270_(N),2, . . . , 1270_(N),K. All thecontention units within each row in the matrix are fed, via leads 1260specifically containing leads 1260₁, 1260₂, 1260₃, . . . , 1260_(N),with ATM cells incoming on a corresponding input line, e.g. respectiveinput lines 273₁, 273₂, 273₃, . . . , 273_(N). Each column of contentionunits, specifically columns 1265₁, 1265₂, . . . , 1265_(K), is fed, on adaisy-chained basis, with common address and priority bits that aregenerated by an associated address broadcaster, specifically respectivebroadcasters 1220₁, 1220₂, . . . , 1220_(K). A column of contentionunits, such as column 1265₁, and its associated address broadcasterroute ATM cells to a corresponding group of L×M shared output lines(here illustratively constituting 320 such lines), e.g. lines 11151within all output lines 1115 that are produced by grouping network 1110.

Each contention unit, given the address and priority bits broadcastthereto--hereinafter collectively referred to as a broadcast cell--andthe incoming cells, performs a two level comparison between everyincoming ATM cell applied thereto and the broadcast cells it receives.If an address contained within any such incoming cell matches theaddress broadcast to that contention unit, then that unit routes theincoming cell to one of its shared outputs, with the particular outputbeing determined by the number of contending requests for all theseoutputs and with high priority incoming cells being given preference forthat output over low priority incoming cells. The outputs of thiscontention unit in any column feed the inputs of the next successivecontention unit in that column so as to interconnect all the contentionunits in that column in a daisy-chained fashion. For example, the 320outputs of contention unit 1270₁,1 are applied, in parallel, via leads1277, to 320 respective inputs to contention unit 1270₂,1 The contendingrequests for outputs, whenever they occur, within each contention unitin any column, such as unit 1270₂,1 in column 1265₁, are caused by theincoming ATM cells that are applied from a corresponding input line,e.g. line 1260₂, and ATM cells being simultaneously routed downward froma prior contention unit, such as unit 1270₁,1 in the same column. Byvirtue of the daisy-chained connections of all N contention units ineach column, these units effectively route L×M commonly addressedsimultaneously occurring incoming ATM cells on N input lines 273 to theshared output lines for that column, such as to shared output lines1115₁ associated with column 1265₁ for cells addressed to group 1. Anynumber of incoming cells that exceeds L×M cells are simply dropped off("knocked out") by the contention units in the column and are not routedonward. Every column of contention units generates a corresponding groupof L×M shared output lines. In this regard, contention units 1270₁,1,1270₂,1, 1270₃,1, . . . , 1270_(N),1 provide 320 separate shared outputlines 1115₁ which collectively constitute group 1; contention units1270₁,2, 1270₂,2, 1270₃,2, . . . , 1270_(N),2 provide 320 separateshared output lines 1115₂ which collectively constitute group 2, and soon with contention units 1270₁,K, 1270₂,K, 1270₃,K, . . . , 1270_(N),Kproviding 320 separate shared output lines 1115_(K) which collectivelyconstitute group K (32).

Each address broadcaster 1220₁, 1220₂, . . . , 1220_(K), continuallybroadcasts the same bit sequence in every cell broadcast to each columnof contention units. The sequence contains a specific address of thatcolumn, i.e. a specific group of shared output lines, and priority bitsthat are set to the lowest priority, typically zero. For addressbroadcasters 1220₁, 1220₂, 1220_(K), the broadcast bit sequences forcolumns 1265₁, 1265₂, and 1265_(K) are shown as bits 1232, 1234 and 1236with addresses A₁, A₂ and A_(K) being set to the respective address, 1,2, . . . , K, of the corresponding column (group). These sequences arebroadcast into the first contention unit in each column as indicated byan adjacent arrow. The priority bits which follow the address bits ineach of these sequences are set to zero.

For the case of N=8192, each broadcast bit sequence contains thirteenaddress bits followed by three bits: the first of which is an activityor "busy" ("b") bit followed by two priority ("p") bits. To simplify thefollowing discussion, since the busy bit which merely indicates whetherthe cell is valid or not is processed in the same basic manner as apriority bit, the busy bit will be hereinafter treated as though it werea priority bit. Of the thirteen address bits, only the five mostsignificant bits (in field 127 shown in FIG. 1) are needed to select oneof the 32 different groups in grouping network 1110. Of the remainingaddress bits, the next three address bits (situated in field 125 shownin FIG. 1) are used to select one of eight groups of shared linksprovided by each of the second grouping networks, e.g. network 1140shown in FIG. 11, with the remaining five address bits (situated infield 123 shown in FIG. 1) being used to select one of 32 individualoutputs provided by each of the third stage routing networks, e.g.network 1160 shown in FIG. 11. While each address broadcaster in everyrouting network broadcasts a full thirteen bit address to everycontention unit in its corresponding column, through appropriate timingsignals applied thereto, as described in detail below, that contentionunit only compares the address and associated priority bits that areapplicable to the specific grouping network to which it belongs andtotally ignores all the remaining bits in the prepended routing headerof each incoming ATM cell applied thereto. Specifically, each columnwithin grouping network 1110 is uniquely addressed through the firstfive address bits in the entire prepended routing header. In addition,each one of address broadcasters 1220 delays the timing signals by a bitinterval and applies the resulting delayed signals to the firstcontention unit in its associated column. The occurrence of these timingsignals specifies time windows during which each contention unit is toperform bit comparisons of the address and priority fields. One suchwindow exists for comparison of address bits; a successive window existsfor comparison of priority bits. These timing signals (specificallyreferred to as "x1" and "x2" below) are appropriately set for eachgrouping network in order to define the particular timing windows thatencompass the proper address and priority bits which are to be comparedin the prepended routing headers of the cells propagating through thatnetwork. As indicated by dashed lines in FIG. 12, these timing signalsare passed in a daisy-chained fashion from one contention unit to thenext successive unit within any one group. Each contention unitappropriately delays these timing signals by a bit interval to assureproper phasing of these signals with the incoming address and prioritybits that are to be applied to the next successive unit.

In addition, to maintain proper bit timing through the matrix, theincoming ATM cells that appear on each successive line in input lines273 are delayed by an appropriate number of bit times through skewbuffers 1240. Skew buffers 1240₁, 1240₂, 1240₃, . . . , 1240_(N), whichcollectively form skew buffers 1240, provide correspondingly increasingamounts of delay to incoming ATM cells that appear on respective inputlines 273₁, 273₂, 273₃, . . . , 273_(N). As discussed in detail below inconjunction with FIG. 14, the amount of delay that is provided by eachskew buffer increases by one bit time from each input line to the next.This delay matches the propagation delay imparted to the broadcastaddress and priority bits as they are successively applied from onecontention unit in any one column to the next successive unit in thesame column and, as such, maintains proper bit alignment between theincoming and broadcast address and priority bits that are applied toeach contention unit. Within grouping network 1110, synch(synchronization) circuit 1210 receives appropriate clock signals onleads 1205 and generates timing and clock signals, over leads 1230, thatare applied to first skew buffer 1240₁ and each address broadcaster and,through daisy-chained connections, to every successive skew buffer andeach contention unit therein.

With this overall description of grouping network 1110 in mind, FIG. 13depicts a block diagram of illustrative contention units 1270₁,1,1270₂,1 and 1270₃,1 used in this grouping network as well as theirinterconnections and the manner in which illustrative incoming ATM cellsare routed through these units.

As shown, each contention unit is formed of a series of L×M(illustratively 320) separate identical switching circuits and a delayelement. For example, contention unit 1270₁ contains switching elements1340₁,1, 1340₁,2, . . . , 1340₁,320. Similarly, contention units 1270₂and 1270₃ respectively contain switching elements 1340₂,1, 1340₂,2, . .. , 1340₂,320 and switching elements 1340₃,1, 1340₃,2, . . . ,1340₃,320. Vertically aligned switching elements are serially connectedfrom one contention unit to the next to form columns of "N" switchingelements. An address broadcaster feeds identical broadcast cells 1232₁,1232₂, . . . , 1232₃₂₀ (containing identical address and zero-valuedpriority bits), via leads 1273₁, specifically containing leads 1273₁,1273₂, . . . , 1273₃₂₀, into the first switching element, e.g. element1340₁,1, in each such column.

Inasmuch as the arrangement and interconnection of the identicalswitching elements and associated delay elements are highly regular, thephysical density of the overall switching fabric can be quitesubstantial by fabricating rows of interconnected switching elements inmodular form using very large scale integrated circuits. These moduleswould, in turn, be interconnected again on a regular basis to formlarger modules that each have successive internal levels of groupingnetworks, and so on in order to recursively construct the entireswitching fabric in a relatively small physical space.

Each switching circuit, which will be described in detail below inconjunction with FIGS. 15 and 16, has two data signal inputs and twodata signal outputs. For convenience, these inputs and outputs will beidentified by their relative directional location on each element:north, south, east and west. Incoming cells, whether from an associatedinput line or routed from a prior switching element, as discussed below,are applied on the north and west inputs. For convenience, the incomingbit-serial cells applied to these inputs will hereinafter be referred toas "d_(n) " and "d_(w) ", respectively. Outgoing cells, as routedthrough a switching element, are applied to either the south or eastoutputs of that element. Also, for convenience, the outgoing bit-serialcells provided by these outputs will be hereinafter referred to as,"d_(s) " or "d_(e) ", respectively. A switching element, such asillustrative element 1340₁,1, can exist in one of two states: a crossedor non-crossed state. Whenever a switching element is in a crossedstate, an incoming cell applied to the west input of that element isrouted to the east output and an incoming cell applied to the northinput of that element is routed to the south output thereof. The routingpaths through various switching elements shown in FIG. 12 are depictedby dashed lines. Illustrative cell 1340₁,1 is shown, through lines 1342,as being in the crossed state. Alternatively, whenever a switchingelement is in a non-crossed state, an incoming ATM cell applied to thewest input of that element is routed to the south output and an incomingcell applied to the north input of that element is routed to the eastoutput thereof. Illustrative cell 1340₂,1 is shown, through lines 1344,as being in the non-crossed state.

Ordinarily, a switching element remains in the crossed state. However,that element will assume the non-crossed state if the incoming cellsapplied to the north and west inputs satisfy two conditions. First, theaddresses of these cells must match. If the cell is an incoming ATMcell, then the address lies in that portion of the stage of the routingheader corresponding to the grouping network that contains the switchingelement. For all the elements shown in FIG. 13, the address is a fivebit address field lying in first stage routing header 127 (see FIG. 1).If that cell is a broadcast cell, then the address is the address bitsin the broadcast cell that are applicable to the stage of the groupingnetwork. Similarly, for the cells shown in FIG. 13, the appropriatebroadcast address bits form the most significant five address bits ofeach thirteen bit broadcast address. Second, if the addresses of twocells applied to the north and west inputs match, then the cell appliedto the west input must have a higher priority value than the cellapplied to the north input. This necessary priority difference betweenthe two cells will henceforth, for convenience, be referred to as the"priority condition". Thus, as all the incoming and broadcast cellspropagate through the switching elements in a group, then, within anycolumn of contention units that form that group, the address andpriority comparisons performed within each switching element thereincause empty cells, which originate from the address broadcasters,followed by low priority incoming ATM cells to be successively pushed tothe right from switching element to switching element and from eachcontention unit to the next by the high priority incoming ATM cells thatare applied from the left to that group. By virtue of comparing priorityof two input cells within each individual switching element, the entirefunction of contention resolution is distributed on an elemental basisthroughout the switch, rather than being centralized. Inasmuch as thistotally eliminates the need to use a central contention resolutiondevice within the switch fabric, the complexity of the fabric issignificantly simplified and the interconnects in the switch fabric thatmight otherwise be used to couple each switching element to acentralized contention device are also eliminated, thereby substantiallyreducing the total number of interconnects that are needed in thefabric.

As discussed above, each broadcast address shown in FIG. 1 for the threestage switch shown in FIG. 11, contains thirteen separate prependedaddress bits. However, each switching element only compares one of threeaddresses contained in three stage prepended address field. Timingsignal x1, shown in FIG. 13, is applied to each switching element. Thissignal defines an appropriate time window in terms of successive bitintervals, during which that element is to compare the address bits ofthe incoming cells applied to that element. As long as that signal ishigh, address comparisons can occur on a bit-by-bit basis. When thesignal is low, the address bits of these incoming cells are simplyignored by that switching element. Similarly, timing signal x2 is alsoapplied to each switching element. This signal defines an appropriatetime window in terms of successive bit intervals, during which thatelement is to compare the priority bits of the input cells applied tothat element. As long as that signal is high, priority comparisons canoccur on a bit-by-bit basis. When the signal is low, the priority bitsof these input cells are simply ignored by that switching element.

To maintain synchronization, clock signals are simultaneously applied,via leads 1350, to all the switching elements and the delay elements ina grouping network, which for network 1110 (see FIG. 12) includes but isnot limited to all the elements shown in FIG. 13. Furthermore, tomaintain correct bit alignment between the start of the incoming cellsapplied to each switching element within any contention unit, such aswithin unit 1270₁,1, and from one contention unit to the next, thesetiming signals propagate with the cells from one switching element tothe next and from one contention unit to the next. In particular, timingsignals x1 and x2 are propagated in a daisy-chained fashion fromswitching element to switching element within any contention unit, witheach element imparting a delay of a single bit interval to both of thesesignals. In addition, these timing signals also propagate in adaisy-chained fashion, via illustrative leads 1360, 1362, 1364 and 1366,from the address broadcaster, such as broadcaster 1220₁, to eachsuccessive contention unit, e.g. units 1270₁,1, 1270₂,1 and 1270₃,1through an associated delay element and so on throughout all such unitsin the associated column. To assure proper bit alignment between thesetiming signals and the input cells within each successive contentionunit, each of these delay elements, specifically 1330₁, 1330₂, 1330₃ forcontention units 1270₁,1, 1270₂,1 and 1270₃,1, respectively, imparts asingle bit interval delay to both of these timing signals as theypropagate from each contention unit to the next. All the delay elementsare synchronized by the clock signal. Inasmuch as the lengths of theinterconnection wires running from each switching element to the next,both vertically and horizontally, are all short and can be readily keptessentially identical, this provides two advantages. First, uniforminterconnects relax the timing alignment that is required betweenindividual switching elements. Second, since each switching element onlyneeds to drive relatively short interconnects, relatively low poweroutput drivers can be used. This advantageously reduces the powerconsumption of each switching element as well as the heat dissipatedthereby. Furthermore, through the use of grouping networks, data andtiming signals need to be synchronized only within each grouping networkinstead of throughout the entire switch fabric, thereby furthersimplifying internal switch synchronization.

Having now described the circuitry that forms each contention unit andthe manner in which successive contention units are interconnected in agrouping network, I will now describe the manner in which illustrativeincoming ATM cells are successively routed through the switchingelements. For ease of illustration and simplicity, I will provide thisdiscussion in the context of the elements shown in FIG. 13.

As discussed, address broadcasters 1220 serially apply identicalbroadcast cells 1232₁, 1232₂, . . . , 1232₃₂₀, via serial leads 1273₁,1273₂, 1273₃₂₀, to the north input, as cell d_(n), of the firstswitching element in each column, e.g. element 1340₁,1, 1340₁,2, . . . ,1340₁,320. At the same time as a broadcast cell is applied to firstswitching element 1340₁,1 in the first contention unit, an incoming ATMcell, illustratively cell 1313 is applied over input lead 1275₁, as celld_(w), to the west input of the same switching element. Upon receipt ofthese two cells, switching element 1340₁,1 begins a bit-by-bitcomparison of specific corresponding address and specific correspondingpriority bits in these cells. As discussed above, a switching elementremains in a crossed state, such as that shown by lines 1342, unless thecorresponding addresses of both incoming cells match and the prioritycondition is met in which case that element assumes a non-crossed stateas illustratively indicated by lines 1344.

Now, by just focusing on the results of such comparisons thatsuccessively occur throughout the cells shown in FIG. 13 and ignoringsynchronization, the manner in which individual cells are routed todifferent shared output lines in any one group becomes very clear.Inasmuch as the address, A₂, of incoming ATM cell 1313 does not matchthe address, A₁, contained in each broadcast cell, then switchingelement 1340₁,1 remains in a crossed state. As a result, this switchingelement routes incoming ATM cell 1313 to its east output and broadcastcell 1232₁ to its south output. The east output is connected, via lead1384, to the west input of switching element 1340₁,2. The symbol "xx"within each incoming ATM cell indicates all remaining bits in that cell;these bits are not compared in a switching element but are merely routedtherethrough. Since the address of incoming ATM cell 1313 again fails tomatch the broadcast address contained in broadcast cell 1232₂ that issimultaneously being applied to the north input of switching element1340₁,2, this switching element also remains in a crossed state. As aresult, incoming ATM cell 1313 is routed to the east output of element1340₁,2. In fact, since the address of this cell does not match theaddress, A₁, contained in any of the remaining cells broadcast byaddress broadcaster 1220₁, incoming ATM cell 1313 continues tosuccessively propagate to the right, one switching element at a time,through contention unit 1270₁,1. Eventually, this cell will reach thelast switching element, i.e. element 1340₁,320 in this unit after whichthe cell will simply be dropped off (knocked off) the unit since it canpropagate no further to the right. This is diagrammatically indicated bycell 1313 situated to the right of element 1340₁,320. As to broadcastcell 1232₁ routed to the south output of element 1340₁,1, thisparticular cell is serially applied on a bit-by-bit basis, via lead1372₁, to the north input of switching element 1340₂,1. Concurrentlywith the arrival of this cell at this input, incoming ATM cell 1315 isserially applied, also on a bit-by-bit basis, via lead 1275₂, to thewest input of the same switching element. Since the appropriate address,A₁, contained in incoming cell 1315 matches that in broadcast cell1232₁, switching element 1340₂,1 proceeds to serially compare theappropriate priority bits contained in both of these cells. Inasmuch asincoming ATM cell 1315 contains a priority value of "2" which clearlyexceeds the zero priority value contained in broadcast cell 1232₁,switching element 1340₂,1 assumes a non-crossed state, as shown bydashed lines 1344. Accordingly, incoming ATM cell 1315 is routed by thiselement to its south output while this element routes broadcast cell1232₁ to its east output. As such, broadcast cell 1232₁ propagates tothe right to switching element 1340₂,2 wherein this cell isappropriately compared against to broadcast cell 1232₂ Although theaddresses of these two broadcast cells match, the priority of both cellsis equal, specifically zero. Consequently, switching element 1340₂,2remains in a crossed state and routes broadcast cell 1232₁, via its eastoutput, to the right to a successive switching element in contentionunit 1270₂,1 for further comparisons and routes broadcast cell 1232₂,via the south output of this switching element, downward to the northinput of switching element 1340₃,2. As ATM cell 1315 is being seriallyrouted on a bit-by-bit basis from the south output of element 1340₂,1into the north input of switching element 1340₃,1, incoming ATM cell1317 is being serially routed, via lead 1275₃, into the west input ofthis same switching element. Since the appropriate address, A₁, of bothof these ATM cells match but the corresponding priority of cell 1317,being "1", is less than that of cell 1315, i.e. "2" in value, switchingelement 1340₃,1 remains in a crossed state. As such, switching element1340₃,1 routes incoming ATM cell 1315 to its south output While routingincoming ATM cell 1317 to its east output and into the west input ofswitching element 1340₃,2. As cell 1317 is being serially routed intoelement 1340₃,2, broadcast cell 1232₂ is being simultaneously applied tothe north input of this same element. Inasmuch as the correspondingaddresses of cells 1317 and 1232₂ match but the priority of ATM cell1317, being "1" in value, is higher than the zero-valued priority of thebroadcast cell 1232₂, switching element 1340₃,2 assumes a non-crossedstate. Consequently, this element routes incoming ATM cell 1317 to itssouth output while routing broadcast cell 1232₂ to the right, via itseast output, to a next successive switching element in contention unit1270₃. The cells appearing at the south outputs of all the individualswitching elements within contention unit 1270₃ are routed along withthe timing and clock signals, via respective leads 1376, 1350 and 1366,to the next successive contention unit for comparisons against anincoming ATM cell appearing on a successive input line and so onthroughout the remainder of column 1265₁ (which contains thesecontention units) within grouping network 1100.

Thus, as can be readily appreciated, each incoming ATM cell enters agrouping network from the left and is first routed downward into acolumn of contention units and thereafter within that column issuccessively routed either downward or to the right as that cellpropagates from one contention unit to the next through that columnuntil the cells either reaches a shared output line or is simply"dropped" from a contention unit therein. The specific column throughwhich that cell propagates downward in any grouping network isdetermined by the value of a corresponding routing address containedwithin that cell.

With this routing description in mind, to maintain appropriatesynchronization among the switching elements in each column of agrouping network, the incoming ATM cells and broadcast cells applied tothat column must be appropriately skewed, with the skew varying by onebit interval from each successive input or broadcast line to the next.In this regard, FIG. 14 diagrammatically shows the amount of skew thatneeds to occur between adjacent bit streams (both for incoming andbroadcast cells) within a column of switching elements, specificallycolumn 1265₁, in grouping network 1110 shown in FIG. 12.

As shown, for grouping network 1110, the maximum timing skew applied tothe incoming ATM cells is N bit times; while the maximum amount oftiming skew applied to the broadcast cells is L×M bit times. Similarly,the maximum timing skew for the broadcast cells for grouping network1140 and 1160 would be L'×M' bit times and L" bit times, respectively.The timing skewed outputs from a grouping network can be directly fed tothe inputs to the next successive grouping network without the need toinclude additional skew buffers therebetween.

Furthermore, two adjacent incoming ATM cells that originate from acommon user line can be distributed within a grouping network such thatone of these cells is directed to the leftmost link while the other cellis directed to the rightmost link within the same shared group of outputlinks. As such, should this occur for grouping network 1110 (see FIG.11), the timing difference between these two cells might be C-(L×M-1)bit times if the cell arrives at the right-most link, where C is thecell length in bits, and the second cell arrives at the left-most link,or C+(L×M-1) bit times if these cells arrive at the opposite links.Hence, to maintain proper cell sequencing throughout the entire groupingnetwork, the number of vertical links in every group of shared outputsmust be less than C to ensure that C-(L×M)>0. With N input lines, thepropagation delay for a cell passing through grouping network 1110ranges from N to N+(L×M) bit times depending upon which particularshared output link that cell is delivered. For the entire three-stagenetwork shown in FIG. 11, the total propagation delay ranges from(N+L×M+L'×M') bit times to (N+2×L×M+2×L'×M'+L") bit times. Thus, for aATM packet switch with 8192 separate input lines and implemented usingmy inventive recursively grouped distributed knockout switch, asdescribed above with the illustrative numeric values for L, M, L' and L"set forth above, the propagation delay for any ATM cell transitingthrough this switch will fall between 8,576 and 8,972 bit times orbetween 20 and 21 ATM cell time intervals, which equates to betweenapproximately 57 to 61 μsec--which is quite acceptable.

As noted above, all the switching elements used in my inventiverecursively grouped distributed knockout switch are identical. Thus, forpurposes of illustration, FIG. 15 is a circuit diagram of one suchswitching element, illustratively element 1340₁,1 shown in FIG. 13.Since FIG. 16 depicts various waveforms that occur within illustrativeswitching element 1340₁,1, the reader should simultaneously refer toboth FIGS. 15 and 16 throughout the following discussion of thisswitching element.

As described above, each switching element performs a serial bit-by-bitcomparison of corresponding address and priority bits of the serial bitstreams of incoming cells applied to its north and west inputs in orderto set the state of that element and route the incoming cells to eitherits east or south outputs. Ordinarily, the switching element remains inthe crossed state. In this state, a current incoming cell that is beingserially applied to the west input of that element is routed to its eastoutput and a current incoming cell that is being serially applied to thenorth input of that element is routed to its south output thereof.However, if the address bits match and the priority condition is met bythe cells currently applied to the west and north inputs, then thatswitching element will assume a non-crossed state. In this state, theelement routes the incoming cell currently applied to the west input ofthat element to the south output and the incoming cell currently appliedto the north input to the east output.

As shown, switching element 1340₁,1 is formed of two portions: routingcircuit 1503 and control circuit 1507. Routing circuit 1503 provides therouting paths from collectively the north and west inputs tocollectively the south and east outputs as well as providing adaisy-chained interconnection for the x1 and x2 control signals to thenext successive switching element. Control circuit 1507, relying ontiming signals x1 and x2 and the bit serial signals appearing on thenorth and west inputs, controls the operation of the routing circuit.All the incoming signals are bit-synchronized with the clock (ck)signal. All the transistors used in the switching element are either Por N type field effect transistors (PFETs or NFETs).

Within routing circuit 1503, incoming timing signals x1 and x2 andserial incoming cells d_(n) and d_(w) which are simultaneously applied,via leads 1360, 1273₁ and 1275₁, to element 1340₁,1 are each delayed byone bit interval through flip-flops 1510, specifically individualflip-flops 1510₁, 1510₂, 1510₃ and 1510₄ through which the x1 and x2signals and d_(n) and d_(w) cells are respectively clocked by the clocksignal applied to lead 1581. The output of flip-flop 1510₁ issuccessively applied through inverters 1586 and 1588, the formerproviding control signal x1e bar (the term "bar" indicates negation).The delay imparted to the x1w signal by both of these inverters assuresthat timing signal x1e will overlap with timing signal x2e, therebypreventing the "match" signal, as described below, from incorrectlycharging from a low to a high state while timing signal x2e istransiting from a high to a low state. The outputs of inverter 1588 andflip-flop 1510₂ are respectively applied, as timing signals x1 and x2,through leads 1382 to the inputs of a next successive switching elementin a contention unit. The suffixes "n", "e", "s" and "w" respectivelydenote the north and east inputs and the south and west outputs. The bitstreams propagating through flip-flops 1510₃ and 1510₄, specificallyd_(n) ' and d₂ ', are inverted by inverters 1592 and 1594 to providesignals d_(n) ' bar and d_(w) ' bar. Bit streams d_(n) ' and d_(w) ' areapplied to transmission gates 1520, which, through the state of the"cross" signal (to be described in detail below) buffered throughinverters 1584 and incident on all the control inputs of these gates,routes these bit streams to the appropriate outputs, d_(s) and d_(e),respectively, for a crossed state or d_(e) and d_(s) in a non-crossedstate. Transmission gates 1520 are formed of gates 1522, which route bitstream d_(n) ' or d_(w) ' to the south output, i.e. lead 1372₁, andgates 1524, which route bit stream d_(n) ' or d_(w) ' to the eastoutput, i.e. lead 1384. Gates 1520 and 1524 each contain two separatetransmission gates which always operate in opposite modes.

As discussed above, switching element 1340₁,1 ordinarily assumes the"crossed" state. In this state, the "cross" signal remains at a "high"level. Based upon the results of a serial bit-by-bit comparison of theappropriate address and, when necessary, priority bits of the twoincoming cells, which occur within the corresponding timing windowsestablished by timing signals x1 and x2, control circuit 1507 dischargesthe "cross" signal to a "low" level to change the routing provided bythe switching element from a crossed to a non-crossed state.

Control circuit 1507 generates three distinct control signals: a "cross"signal, a "match" signal and a "stop" signal. The "cross" signal, asdescribed above, sets the state of the transmission gates. This signalis initially at a high state and is placed in a low state only if anaddress match occurs between these cells and these cells also satisfythe priority condition. The match signal remains in a high state as longas each pair of corresponding address bits of the two incoming cellsserially appearing on the north and west inputs match and, in the eventof a complete address match, then throughout the remainder of the entireATM cell time interval. The stop signal goes low as soon as the serialpriority bit appearing at the west input is detected to be larger invalue than the corresponding priority bit simultaneously appearing atthe north input in order to cease all further such comparisons involvingthe two incoming bit streams on the north and east inputs throughout theremainder of the ATM cell time interval.

Now, to understand the operation of the switching element, assume thatthe "cross" signal is high. In fact, upon the start of every ATM celltime interval, the "cross", "match" and "stop" signals are allpre-charged to a high level. Specifically, at the start of an ATM celltime interval, timing signals x1e and x2e to PFETs 1552 and 1548 are lowwhich cause these PFETs to conduct. Inasmuch as timing signal x1w islow, NFETs 1544 and 1546 are open-circuited. Consequently, the "match"signal, which occurs at the drains of PFETs 1548 and 1556, goes highwhich through inverter 1558 is applied to the gate of PFET 1556.Inasmuch as the signal appearing at the gate of PFET 1556 is low, thisPFET is open-circuited. The output of inverter 1558 is also appliedthrough inverter 1562 to the gate of NFET 1578 which causes this NFET toconduct. However, since timing signal x2e, which is applied to the gateof NFET 1576, is low, this NFET remains open-circuited during theaddress bit comparisons. Inasmuch as the drain of this NFET is connectedto the source of NFET 1578, no current flows through either of theseNFETs. Since the drain of NFET 1578 is serially connected to the sourceof NFET 1580, NFET 1580 does not conduct any current from its source toits drain if the "stop" signal is low. The drain of NFET 1580 isconnected to the drain of PFET 1582. Inasmuch as timing signal x1e islow, this timing signal causes PFET 1582 to conduct which pulls the"cross" signal appearing at the source of this PFET to power level+V_(DD) (a "high" level). As to the "stop" signal, this signal appearsat the drain of PFETs 1572 and 1574 which are both connected throughtheir drains to power level +V_(DD). Inasmuch as timing signal x1e islow, this timing signal causes PFET 1572 to conduct. By virtue of theconnection of the source of PFET 1572 to the drain of NFET 1566 and thelow level of timing signal x2e which is applied to the gate of NFET1566, this NFET remains off. Consequently, that "stop" signal is pulledup, through PFET 1572, to a high level. PFET 1574 also conducts due tothe inversion of the "stop" signal provided by inverter 1570.

As specifically shown in FIG. 16, timing signals x1 and x2,illustratively indicated by waveforms 1620 and 1630, with the clockwaveform indicated by waveform 1610, respectively define timing windows,t₁ and t₂, that span the occurrence of address bits a2, a1 and a0, andbusy bit b and priority bit p (these latter two bits being collectivelyconsidered, as noted above, as the priority bits). Two differentsituations are shown: situation 1605, in which the address bit match andthe priority condition is met, and situation 1609 in which the addressbits do not match.

It is only during timing window t₁ that control circuit 1507 willcompare corresponding bits of both incoming cells applied to the northand west inputs to determine if the addresses of these cells asrepresented by these bits match each other. If such a match occurs, thencontrol circuit 1507 will compare corresponding bits of both incomingcells applied to the north and west inputs during timing window t₂ todetermine if the priority condition is met.

If, as occurs in situation 1605, an address match occurs and as soon asthe priority condition is met for the two incoming cells (assumed tooccur here at the last priority bit), then, upon the conclusion of thecomparison of priority bit in both cells (which occurs half way throughthe corresponding bit time), the "match" signal, illustratively shown aswaveform 1650 remains high but the "cross" signal, as depicted bywaveform 1660, goes low. At this point in time, switching element1340₁,1 assumes the non-crossed state to appropriately route the lastpriority bit and all the remaining bits in both incoming cells to theappropriate outputs of switching element 1340₁,1. Inasmuch as thepreceding address and priority bits in the prepended routing header arethe same between the two cells, these bits are routed, though in acrossed state, to both outputs during the bit times therefor. It must benoted that, owing to the inversion of the clock signal applied to NFET1542, the clock bar signal prevents the "match" signal from beingincorrectly discharged due to the overlap of the dn' and dw' barsignals, or the dn' bar and dw' signals. Bit comparisons occur duringthe second half of a corresponding bit time with the switching elementchanging state (and hence its routing pattern), if necessary, duringthis half of the bit time, specifically shortly after the falling edgeof the clock signal. The falling edge defines the start of the secondhalf of that bit time. Bit data provided by any cell is only valid atthe end of the bit time, which occurs coincident with a rising edge ofthe clock signal. As such, the differing priority bits appear at theproper outputs of the switching element at the conclusion of the bittime. During the remaining bit times in the current ATM cell timeinterval, the remaining bits in the incoming cells then being applied toswitching element 1340₁,1 successively follow these priority bits to theproper outputs of this element.

Alternatively, as shown in situation 1609, if an address mismatch occursduring any bit comparison, such as for corresponding address bits al,then the "match" signal, depicted by waveform 1650, falls to a low levelduring the second half of the bit time for the particular bits thenbeing compared. As such, the "cross" signal, as depicted by waveform1660, which was initially precharged to a high level, then remains highthroughout the remainder for the current ATM cell time interval.

With respect to the remainder of the topology of control circuit 1507itself, circuit 1530, formed of individual NFETs 1532, 1534, 1536 and1538 being respectively connected to the dn', dn' bar, dw' bar and dw'signals, implements an exclusive OR gate. This gate is activated by NFET1542. The outputs of this gate, i.e. the sources of NFETs 1536 and 1538,are both connected to the drain of NFET 1542. The clock (ck) bar signalis applied to the gate of NFET 1542; the source of this NFET isgrounded. The drains of NFETs 1536 and 1538 are respectively connectedto the sources of NFETs 1532 and 1534 which, in turn are respectivelyconnected to the sources of NFETs 1566 and 1576. These source-drainconnections are themselves respectively connected through NFETs 1544 and1546 which are both commonly driven by signal x1w' applied to theirgates. The drains of NFETs 1544 and 1546 are connected together to thedrains of PFETs 1548 and 1556 and the input of inverter 1558. The x2esignal is applied to the gate of NFET 1566 with its drain, at which the"stop" signal is generated, being connected to the drains of PFETs 1572and 1574.

Bit comparisons are performed within exclusive OR gate 1530. Owing tothe application of the ck (clock) bar signal to NFET 1542, either leg ofgate 1530 is able to sink current through NFET 1542 only during thesecond half of any bit interval (when the ck bar is high). As such, thisgate is active only during this half of any bit time. At the beginningof the time window that spans the occurrence of the address bits, timingsignal x1w' assumes a high level and remains high throughout thiswindow. Accordingly, the high level x1e signal causes NFETs 1544 and1546 to both become conductive. However, PFETs 1552 and 1548 assume anon-conductive state. The "match" signal occurring at the drains ofNFETS 1544 and 1546 remains high due to conducting PFET 1556. Now, uponthe occurrence of a mismatch between corresponding address bits, bothNFETs in one leg (NFETs 1532 and 1536) or the other (NFETs 1534 and1538) of gate 1530 will conduct and sink current through NFET 1542. Assuch, the drain of either NFET 1532 or 1534 will be pulled low, i.e.grounded. Inasmuch as signal x1w' is high during this time, NFETs 1544and 1546 will also be conducting. Consequently, as soon as a mis-matchoccurs, the drains of NFET 1544 or 1546 will be pulled to ground therebycausing the level of the "match" signal to assume a low state. This lowstate, in turn, will turn off PFET 1556 and NFET 1578. Inasmuch as thex2e signal has not yet occurred, NFET 1576 will have been off during allpreceding address bit comparisons. Inasmuch as NFET 1578 will now beturned off, the occurrence of the x2 timing window, during which the x2esignal goes high, will not cause current to be conducted through PFET1582 and NFET 1580. Consequently, the "cross" signal appearing at thedrain of PFET 1582 will remain high and will not change during theremainder of the ATM cell time.

If, as discussed above, all the address bits match, then the prioritybits are successively compared on a bit-by-bit basis. At the beginningof the time window that spans the occurrence of the priority bits,timing signal x2 assumes a high level and remains high throughout thiswindow. This causes NFETs 1566 and 1576 to both become conductive.However, PFET 1548 maintains a non-conductive state. The "match" signaloccurring at the drains of NFETS 1544 and 1546 continues to remain at ahigh level due to conducting PFET 1556. Now, upon the occurrence of amismatch between corresponding priority bits, both PFETs in one leg ofgate 1530 (PFETs 1532 and 1536) or the other leg (PFETs 1534 and 1538)conduct and sink current through conducting PFET 1542. Inasmuch as thepriority condition is only satisfied if the priority of the cellappearing on the west input is higher than the priority of the cellsimultaneously appearing on the north input, then only one of the twoexclusive OR combinations provided by exclusive OR gate 1530 ispermitted to cause the "cross" signal to change. This condition is givenby inputs dn' bar and dw' to gate 1530 and is isolated from the otheroutput of this gate by non-conducting NFETs 1544 and 1546. At theoccurrence of a desired mis-match between the priority bits, NFETs 1534and 1538 situated within gate 1530 conduct. Due to the isolation of the"match" signal from gate 1530 due to non-conducting NFETs 1544 and 1546,the "match" signal remains at a high level once the address comparisonshave completed and throughout all the priority bit comparisons. Now,inasmuch as the drain of NFET 1534 will be pulled to ground, throughconducting NFETs 1538 and 1542, at the occurrence of the prioritycondition, this provides a discharge path, through conducting NFETs1576, 1578 and 1580, for stored charge situated at the drain of PFET1582. Inasmuch as PFET 1582 is open circuited throughout all prioritybit comparisons, the "cross" signal is discharged to zero upon theoccurrence of the priority condition and remains at a low level for theremainder of the ATM cell interval time. Hence, switching element1340₁,1 assumes the non-crossed state at the occurrence of the prioritycondition and thereafter remains in this state throughout the remainderof the ATM cell time interval.

In the event a mis-match occurs in the priority bits, but in the reversedirection, i.e. the value of a priority bit for the cell applied to thenorth input is "one" while the corresponding bit for the cell applied tothe west input is "zero" valued, then switching element 1340₁,1 is toremain in the crossed state at this point and continue in this statethereafter throughout the remainder of the ATM cell time intervalregardless of the states of the remaining priority bit(s) in thesecells. Specifically, in the event that such a mis-match occurs in thepriority bits, then NFETs 1532 and 1536 in gate 1530 both becomeconductive. Once this occurs, a discharge path is provided through theseFETs, NFET 1542 and NFET 1566 for the stored charge then appearing onthe drain of NFET 1566. Inasmuch as PFET 1572 remains non-conductiveduring priority bit comparisons, the "stop" signal, which appears at thedrain of NFET 1566, decreases to zero. By virtue of inverter 1570 andPFET 1574, the "stop" signal will then remain at a zero level throughoutthe remainder of the ATM cell time interval. Inasmuch as the "stop"signal is applied to the gate of NFET 1580, this signal will cause thisto become open-circuited which, in turn, will cause the stored charge atthe drain of PFET 1582 to substantially remain there. Since signal x1ebar remains at a high level subsequent to all the address comparisonsduring an ATM cell time interval, then, PFET 1582 is also non-conductiveduring this time. Now, owing to the non-conductive state of PFET 1582,any stored charge lost due to self-discharge occurring within NFET 1580will not be replenished during the remainder of the ATM cell timeinterval.

I have performed simulations of an implementation of switching circuit1340₁,1 using well known "SPICE" software programs and through thesesimulations have confirmed the operation of the circuit at rates inexcess of 250 Mbit/second.

Advantageously, my inventive switching element contains a relativelysmall number of transistors which can be reduced to approximately 55transistors if flip-flops 1510₁ and 1510₂ along with gates 1586 and 1588are moved to a centralized circuit that distributes the x1 and x2signals to all the switching elements on the same column or row. If a64-by-64 (approximately 4,000) matrix of identical switching elementswere to be integrated on a single integrated circuit, this circuit wouldcontain on the order of 300,000 transistors which is within thelimitations of currently available 1 micron VLSI CMOS technology.

E. Grouping Network Based Trunk Circuits

A packet switch is often connected through a trunk to another suchswitch such as, for example, one situated at a remote central office. Byvirtue of the trunked connection, all the channels provided by thattrunk are available to carry packet traffic. Hence, a group of trunkedchannels can be shared among the individual outputs provided by theoriginating switch in order to provide multiple virtual paths for eachvirtual circuit connection. As such, cells carrying an identical VCIfield can be routed through any one of a number of individual channelsthat constitute the same grouped channel or have the same routingaddress. Channel grouping can be readily incorporated into an ATM switchto improve its performance in terms of throughput (if input buffering isused therein), cell delay and cell loss probability.

In this fashion, rather than incorporate separate output buffers andinternal queues to drive individual output lines, as depicted in theembodiment shown in FIG. 11, a grouped channel connection wouldpreferably take the place of output buffers 1170 or, if output buffersare needed to provide output synchronization, at least permit the sizeof the queue in each of these buffers to be reduced. In the latter case,whenever the buffer for one such channel becomes full, then incomingcells are simply routed to the next output line for carriage over thenext channel in the same grouped channel. As such, through the use of agrouped channel, multiple servers can access every channel in thatgroup.

To incorporate channel grouping into my inventive switch whilepreserving the order in which individual cells are delivered over agrouped channel to a packet switch, each of the modules 1150 shown inFIG. 11 could be replaced with an L'xM' to M' concentrator. Through useof such a concentrator, the cell order is associated with pre-definedchannel positions, in a top to bottom ordering. Also, all the channelsin a common channel group, are transmitted over the same physicaltransmission line thereby experiencing the same propagation delay. Forexample, sixteen STS-3c channels can be byte-interleaved into an STS-48bit stream (approximately 2.5 Gbit/second) and transmitted on a commonfiber trunk to the next switch node. FIGS. 17A and 17B collectively showtwo separate embodiments of an appropriate L'xM' to M' concentrator.

In particular, FIG. 17A shows a block diagram of one embodiment of anL'xM' to M' concentrator that provides concentration through spacedivision multiplexing. Specifically, this concentrator contains barrelshifters 1710 and 1730, FIFOs 1720 which are formed of individual FIFOs1720₁, . . . , 1720_(L'xM'), and arbiter 1740. Incoming ATM cellsappearing on leads 1145₁, these leads constituting shared output group 1from grouping network 1140 shown in FIG. 11, are shifted through barrelshifter 1710, shown in FIG. 17A, and written in round-robin order intoFIFOs 1720. Barrel shifter 1710 records the number of incoming ATM cellsthat pass through it during the last ATM cell time interval and thenshifts all its inputs in one direction to corresponding outputs, withnumeric address of each specific output being offset from its associatedinput by the value of the recorded number. The cells provided at theoutputs of barrel shifter 1710 are routed, via L'×M' leads 1715, torespective inputs of FIFOs 1720. After the incoming cells are writteninto all the FIFOs, only M' such cells can be simultaneously read outtherefrom. Arbiter 1740, which is connected to each of the FIFOs,decides which FIFOs are to be read during any one cell. The arbiter alsorecords the number of ATM cells that are read out in each current ATMcell time interval and will instruct barrel shifter 1730 to shift itsinput lines by the same number. If during a read operation, a FIFO isempty, then an idle cell is merely sent out the barrel shifter 1730 andthat FIFO is not accessed. Barrel shifter 1730 provides M' outputs whichcollectively, via leads 278, provide M' shared outputs that form acommon grouped channel. Barrel shifters 1710 and 1730, whichcollectively preserve proper cell ordering, can each be replaced with arunning adder address generator cascaded with a reverse banyan network.

FIG. 17B shows a block diagram of a second embodiment of an L'×M' to M'concentrator that provides concentration through time divisionmultiplexing. Specifically, this concentrator contains time divisionmultiplexor 1750, FIFO 1760, read/write controller 1770 and timedivision demultiplexor 1780. Simultaneously occurring incoming ATM cellsappearing on L'×M' leads 1145₁ are multiplexed in a time division mannerinto a serial bit stream which is applied as input to and stored withinFIFO 1760. The contents of the FIFO are serially accessed anddemultiplexed on a cell-by-cell basis into M' separate output leads 278by time division demultiplexor 1780. Read/write controller 1770, whichalso receives the multiplexed bit stream, controls the operation of FIFO1760 by examining the "busy" bit contained within each multiplexed celland, based upon the state of that bit, determines whether that cell isto be written into (or read from) FIFO 1760. Although the secondembodiment shown in FIG. 17B is simpler than the first embodiment shownin FIG. 17A, FIFO 1760 must operate at a speed that is L'×M' timesfaster than that of each individual FIFO in FIFOs 1720 shown in FIG. 17Aor utilize an increased word length such that all L'×M' ATM cells can bestored in one ATM cell interval. With the second embodiment, the valuesof L' and M' not only need to be selected to achieve a desired cell lossprobability, such as 10⁻¹⁰, but also such that the size of the FIFO andits required speed are both compatible with available technology.Alternatively, the M' value can be kept constant across all the groupingnetworks in module 1130 (see FIG. 1) and use a grouping network withinmodule 1150 that provides multiple groups of L"×M" outputs, where L" andM" are selected to provide an appropriate number of shared output linesin each such group.

F. Grouping Network Based Statistical Multiplexors

My inventive grouping network can also be used to advantageouslyimplement a bufferless statistical multiplexor. Such a multiplexor couldbe used in an input module to implement a multiple-input,multiple-output (MIMO) multiplexor to provide line concentration.Although a multiple input, single-output (MISO) multiplexor isrelatively simple to implement, a MIMO multiplexor, owing to statisticalsmoothing of the large number of input sources served by multipleoutputs, advantageously has a smaller cell loss probability resultingfrom buffer overflow as well as imparting less average delay to cellspropagating therethrough than would occur with an MISO multiplexor.

Furthermore, cell traffic is typically bursty in nature. Interfacemodules known in the art typically include input buffers to absorbincoming bursts. However, use of such buffers tends to increase circuitcomplexity, decrease throughput and present difficulties insynchronizing incoming cells and preserving proper cell sequencing amongdifferent input lines. Use of my inventive statistical multiplexoradvantageously eliminates the need for such input buffers and thedifficulties associated therewith.

FIG. 18 shows a block diagram of a second embodiment of an interfacemodule that can be utilized in B-ISDN switch 200 shown in FIG. 2 andspecifically such a module implemented using a bufferless MIMOstatistical multiplexor implemented through a grouping network inaccordance with the teachings of my invention.

As shown, interface module 1800 contains statistical MIMO multiplexor1810, header processing units 310 containing individual headerprocessing units 310₁, . . . , 310₁₈₆, and 16-to-1 time divisionmultiplexors 1830 containing individual time division multiplexors1830₁, . . . , 1830₁₂. Statistical multiplexor 1810 receives incomingATM cells over incoming STS-3c user lines 205₁ which collectivelycontain 1024 separate user lines and multiplexes these incoming cellsonto output leads 1815. Statistical multiplexor 1810 is implemented witha grouping network, as described in detail above, where the number ofindividual leads in output leads 1815 is chosen such that the cell lossprobability through the network is reduced to an acceptable value.Through such a grouping network, there will exist a group expansionratio (L) such that the number of outputs can be expanded from "M" to"L×M" such that the probability of lost cells due to contention withinthe network will be appropriately reduced. For example, with 1024incoming lines and M set equal to the value 128 for a concentrationratio of 8, then, to provide a cell loss probability of 10⁻¹⁰, the valueof L, as set forth in Table 1 above, is 1.45. Accordingly, the number ofseparate outputs provided by the grouping network in statisticalmultiplexor 1810 will be 128×1.45 or approximately 186. As long as thenumber of these outputs is less than the number of bits in an incomingATM cell, cell sequencing will be preserved by multiplexor 1810.Accordingly, multiplexor 1810 is configured to produce 186 separateoutputs. Each different output is connected through a separate leadwithin leads 1810 to a corresponding header processing unit. The headerprocessing unit, as described above, translates the VCI of each cell,over-writes the translated VCI into the cell and prepends a three stagerouting header to that cell. Header processing units 310₁, . . . ,310₁₈₆ are connected to leads 1815₁, . . . , 1815₁₈₆. The resulting ATMcells produced by the header processing units are directed, via leads1829, to 16-to-1 time division multiplexors, specifically multiplexors1830₁, . . . , 1830₁₂, which multiplex the ATM cells on a 16-to-1 basisto form outgoing STS-48 trunks 215₁. As discussed above, all headerprocessing units 310 are connected through lines 245 to switch controlmodule 290 and are controlled thereby.

For ATM cell traffic flowing in an opposite direction, such as fromSTS-48 trunks to user lines, a statistical demultiplexor implementedthrough a well known expansion network could be used. The expansionnetwork would provide the inverse function of a grouping network andhence would not be implemented with a grouping network.

Alternatively, my inventive statistical multiplexor could be tightlycoupled to my recursively grouped distributed knockout switch. Toaccomplish this, the multiplexor would be placed in series with theinput lines to switch 1100 shown in FIG. 11. Since the grouping networkin the statistical multiplexor will appropriately skew the incoming ATMcells from each input line to the next as they pass through thestatistical multiplexor, the cells provided by this multiplexor could berouted directly into a grouping network in the knockout switchingcircuit, such as first stage grouping network 1110, without the need topass through any additional skew buffers. As such, the statisticalmultiplexor would be tightly coupled into the knockout switching circuititself rather than residing in a separate module, such as withininterface module 1800 shown in FIG. 18. This alternative approach wouldincrease the number of switching elements in the switch inasmuch as theinput port count for the first stage grouping network will haveincreased from N to L×N. As an example, for an ATM switch with 8192inputs and using 1024-to-128 statistical input multiplexors, the totalnumber of switching elements in this switch would increase from 1.42N²to 1.98N². Of these 1.98N² switching elements, 0.19N² switching elementswould be used to implement 64 required (8192/128) statisticalmultiplexors.

Clearly, by now, those skilled in the art realize that although myinventive distributed and recursively grouped distributed knockoutswitches have been described as performing B-ISDN switching at theSTS-3c rate (approximately 150 Mbit/second), B-ISDN switching at higherrates can be provided while still preserving the sequencing of inputcells. Such higher speed switching can be readily obtained by dedicatingan appropriately sized group of successive input and output ports toassociated incoming and outgoing high speed trunks and utilizingappropriately sized input demultiplexors and output multiplexors.Specifically, to handle an STS-12 trunk, which carries ATM cell trafficat four times the STS-3c rate or at approximately 600 Mbit/second, agroup of four successive input ports could be dedicated to an incomingSTS-12 trunk. A 1-to-4 time division demultiplexor could precede theseinput ports and convert an incoming STS-12 serial bit-stream into fourSTS-3c streams. Each of these streams could feed a corresponding one ofthe four input ports to the switch. The individual outputs from a groupof four successive output ports on the switch could be multiplexedtogether, again on a 1-to-4 time division basis, to feed an outgoingSTS-12 trunk. Inasmuch as either of the inventive switches preservescell ordering therethrough and the time division multiplexing anddemultiplexing for the high speed trunk(s) occur in the same order, myinventive switches would advantageously preserve the ordering of thebits on a high speed trunk entirely through the switch at multiples ofthe STS-3c rate.

Although various embodiments which incorporate the teachings of thepresent invention have been shown and described in detail herein, thoseskilled in the art can readily devise many other varied embodiments thatstill incorporate these teachings.

I claim:
 1. A grouping network for a packet switch, said groupingnetwork having N input lines and a plurality of output lines andresponsive to incoming packets appearing on said input lines for routinepackets from said input lines to one of said output lines, wherein N isan integer value and said grouping network comprising:K groups of sharedoutput lines which collectively form said plurality of output lines,each of said groups having L×M shared output lines and a commondestination address associated therewith, wherein K, L and M arepre-defined numerical values such that K=N/M and values of L and M areselected so as to provide a pre-determined packet loss probability formore than L×M simultaneously occurring packets being applied over said Nlines for routing to any one of said K groups; and means for logicallyconnecting said N input lines to all of said K groups of output lines,said logically connecting means comprising K substantially identicalmeans, each of which is responsive to the incoming packets appearing onsaid N input lines, for providing a corresponding group of said L×Mshared output lines and for routing packets appearing on said N inputlines and having an address which matches the address associated withsaid corresponding group of output lines to output lines in saidcorresponding group of output lines; and each one of said providing androuting means comprising a matrix of N rows by L×M columns ofsubstantially identical switching elements so as to form a plurality ofmatrices of said switching elements in said grouping network, each oneof said matrices being responsive to the incoming packets appearing onsaid N input lines and connected to all of said L×M output lines in anassociated one of said groups, for filtering packets addressed to theassociated group from said incoming packets appearing on said N inputlines so as to provide filtered packets and for routing the filteredpackets to individual ones of the L×M output lines in said associatedgroup of shared output lines; each individual one of said switchingelements in each one of said matrices being connected to horizontallyand vertically adjacent ones of said individual switching elements so asto form rows and columns of daisy-chained switching elements in said onematrix; and wherein said grouping network further comprises a separatedelay element, associated with each one of said rows of switchingelements in each one of said matrices, for delaying timing signalsapplied thereto so as to form delayed timing signals and for providingthe delayed timing signals to a first one of the switching elements ineach one of said rows, and wherein each of said switching elements ineach one of said rows further comprise means for applying delayed timingsignals to a next successive one of the switching elements in said onerow so as to apply timing signals on a daisy-chained basis throughouteach one of said rows and wherein each of said delay elements appliesdelayed timing signals as input to a delay element associated with anext successive one of said rows so as to inter-connect all delayelements associated with each matrix of switching elements in saidgrouping network on a daisy-chained basis.
 2. Apparatus for a packetswitch comprising:a plurality of grouping networks, each having aplurality of input line and a plurality of output lines and responsiveto incoming packets appearing on said input lines for routing packetsfrom said input lines to ones of said output lines, each of the incomingpackets being an asynchronous transfer mode (ATM) cell, said groupingnetworks being interconnected on a serial basis so as to implement acorresponding plurality of serial routing stages, each one of saidgrouping networks comprising: N input lines, where N is an integer valuethat varies among said networks; K groups of shared output linescollectively forming said plurality of output lines, each of said groupshaving L×M shared output lines and a common destination addressassociated therewith, wherein K, L and M are predefined numerical valuesfor said each network such that K =N/M and the values of L and M areselected for said each network so as to provide both a predeterminedpacket loss probability through said network for more than L×Msimultaneously occurring packets being applied over said N lies forrouting to any one of said K groups of said network and a pre-definednumber of shared output lines in each group of shared output linesemanating therefrom; means for logically connecting said N input linesto all of said K groups of output lines, said logically connecting meanscomprising K substantially identical means, each of which is responsiveto the incoming packets appearing on said N input lines, for providing acorresponding group of said L×M shared output lines and for routingpackets appearing on said N input lines and having an address whichmatches the address associated with said corresponding group of outputlines to output lines in said corresponding group of output lines;means, responsive to input ATM cells, for translating a virtual channelidentifier field in each of said input cells into a routing header andfor prepending said routing header onto said each input cell so as toproduce each of said incoming ATM cells, wherein the routing headercomprises a separate routing address field for each of said routingstages so as to form a plurality of fields, each or said fieldscomprising output destination address bits and priority bits; each oneof said providing and routing means comprising a matrix of N rows by L×Mcolumns of substantially identical switching elements so as to form aplurality of matrices of said switching elements in said groupingnetwork, each one of said matrices being responsive to the incoming ATMcells appearing on said N input lines in an associated one of saidgroups, for filtering incoming ATM cells addressed to the associatedgroup from said incoming packets appearing on said N input lines so asto provide filtered ATM cells and for routing the filtered ATM cells toindividual ones of the L×M output lines in said associated group ofshared output lines; each individual one of said switching elements ineach one of said matrices being connected to horizontally and verticallyadjacent ones of said individual switching elements so as to form rowsand columns of daisy-chained switching elements in said one matrix andeach switching element comprising first and second inputs and first andsecond outputs and being capable of existing in a crossed state in whichATM cells applied to the first and second inputs are respectively routedthrough said element to said first and second outputs or in anon-crossed state in which ATM cells applied to said first and secondinputs are respectively routed to the second and first outputs, eachswitching element further comprising means responsive to timing signalsfor performing serial bit comparisons of incoming address and prioritybits substantially simultaneously appearing on said first and secondinputs during respective time windows defined by said timing signals forchanging the state of said element from the crossed state to thenon-crossed state if address fields of ATM cells being simultaneouslyapplied to the first and second inputs match and if a value of prioritybits of the ATM cell being applied to the second input exceeds a valueof priority bits of the ATM cell being applied to the first input; andwherein each one of said grouping networks further comprises a separatedelay element, associated with each one of said rows of switchingelements in each one of said matrices therein, for delaying timingsignals applied thereto so as to form delayed timing signals and forproviding the delayed timing signals to a first one of the switchingelements in each one of said rows, and wherein each of said switchingelements in each one of said rows further comprises means for applyingdelayed timing signals to a next successive one of the switchingelements in said one row so as to apply timing signals on adaisy-chained basis throughout each one of said rows and wherein eachone of the delay elements applies delayed timing signals as input to oneof the delay elements associated with a next successive one of said rowsso as to inter-connect all delay elements associated with each matrix ofswitching elements in said one grouping network on a daisy-chainedbasis.
 3. In a packet switch having a grouping network, said networkhaving N input lines and a plurality of output lines and responsive toincoming packets appearing on said input lines, wherein N is an integervalue, a method of routing incoming packets through said network to saidplurality of output lines comprising the steps of:in said groupingnetwork: routing packets from said input lines to ones of said outputlines; and wherein said grouping network provides K groups of sharedoutput lines which collectively form said plurality of output lines,each of said groups having L×M shared output lines and a commondestination address associated therewith, wherein K, L and M arepre-defined numerical values such that K=N/M and the values of L and Mare selected so as to provide a pre-determined packet loss probabilityfor more than L×M simultaneously occurring packets being applied oversaid N lines for routing to any one of said K groups, and comprises Ksubstantially identical circuits; in each of said circuits the steps of:providing a corresponding group of said L×M shared output lines; routingpackets appearing on said N input lines and having an address whichmatches the address associated with said corresponding group of outputlines to output lines in said corresponding group of output lines;filtering packets addressed to the associated group from said incomingpackets appearing on said N input lines through a matrix of N rows byL×M columns of substantially identical switching elements so as toprovide filtered packets; and routing the filtered packet to individualones of the L×M output lines in said associated group of shared outputlines; and further comprising, in the grouping network, the steps of:delaying, through a separate delay element contained within saidgrouping network and associated with each one of said rows of switchingelements, timing signals applied thereto so as to form delayed timingsignals; providing the delayed timing signals to a first one of theswitching elements in each one of said rows; and in each of saidswitching elements, the step of: applying delayed timing signals to anext successive one of the switching elements in said one row so as toapply timing signals on a daisy-chained basis.
 4. In a packet switchhaving a plurality of grouping networks, each of said networks having aplurality of input lines and a plurality of output lines and responsiveto incoming packets appearing on said input lines, said groupingnetworks being interconnected on a serial basis so as to implement acorresponding plurality of serial routing stages, a method of routingpackets through said grouping networks comprising the steps of:in eachone of said grouping networks: routing packets from said input lines ofsaid one grouping network to ones of said output lines of said onenetwork; and wherein each one of said grouping networks has N inputlines, where N is an integer value that varies among said networks andprovides K groups of shared output lines collectively forming saidplurality of output lines, each of said groups having L×M shared outputlines and a common destination address associated therewith, wherein K,L and M are pre-defined numerical values for said each network such thatK=N/M and the values of L and M are selected for said each network so asto provide both a pre-determined packet loss probability through saidnetwork for more than L×M simultaneously occurring packets being appliedover said N lines for routing to any one of said K groups of saidnetwork and a pre-defined number of shared output lines in each group ofshared output lines emanating therefrom and comprises K substantiallycircuits, in each of said K circuits the steps of: providing acorresponding group of said L×M shared output lines; routing packetsappearing on said N input lines and having an address which matches theaddress associated with said corresponding group of output lines tooutput lines in said corresponding group of output lines; filteringpackets addressed to the associated group from said incoming packetsappearing on said N input lines through a matrix of N rows by L×Mcolumns of substantially identical switching elements so as to providefiltered packets; and routing the filtered packets to individual ones ofthe L×M output lines in said associated group of shared output lines;and further comprising, in each one of the grouping networks, the stepsof: delaying, through a separate delay element contained within saidgrouping network and associated with each one of said rows of switchingelements, timing signals applied thereto so as to form delayed timingsignals; providing the delayed timing signals to a first one of theswitching elements in each one of said rows; and in each of saidswitching elements, the step of: applying delayed; timing signals to anext successive one of the switching elements in said one row so as toapply timing signals on a daisy-chained basis throughout each one ofsaid rows.